Quasiconvex Programming
| dc.creator | Eppstein, David | |
| dc.date | 2004-12-10 | |
| dc.date.accessioned | 2026-07-07T03:22:11Z | |
| dc.date.available | 2026-07-07T03:22:11Z | |
| dc.description | We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied applications of this geometric optimization technique in meshing, scientific computation, information visualization, automated algorithm analysis, and robust statistics. | |
| dc.description | 33 pages, 14 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0412046 | |
| dc.identifier | http://arxiv.org/abs/cs/0412046 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32498 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2; G.1.6 | |
| dc.title | Quasiconvex Programming | |
| dc.type | text |