Quasiconvex Programming
arXiv:cs/0412046
Abstract
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.
33 pages, 14 figures
Cited by in corpus (8)
- Zero-Convex Functions, Perturbation Resilience, and Subgradient Projections for Feasibility-Seeking Methods
- Fixed points of polarity type operators
- Moving Walkways, Escalators, and Elevators
- Chance-constrained quasi-convex optimization with application to data-driven switched systems control
- Quantum Robust Fitting
- Consensus Maximization Tree Search Revisited
- Planar Lombardi Drawings for Subcubic Graphs
- A note on the quasiconvex Jensen divergences and the quasiconvex Bregman divergences derived thereof