2004/12/10 by David Eppstein, Eppstein, David · 1 citation
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #G.1.6 #Optimization and Search Problems #Optimization and Variational Analysis #cs.CG
paper · pdf · doi:10.48550/arxiv.cs/0412046
33 pages, 14 figures
arxiv created 2004/12/10 · openalex publication_date 2004/12/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.