Quasiconvex Programming
David Eppstein
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.
Create a lesson
Related papers
Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model
Milana Tesfamarian, Michael Heisig, Gabriel Wittum et al.
Multi-Stage NeRF for Efficient 3D Coronary Artery Reconstruction from Two Narrow-Angle Angiographic Projections
Deyu Meng, Mojtaba Lashgari, Yiying Wang et al.
Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons
Shouvik Mondal, Udvas Das, Sasanka Roy
Low-Dimensional Embeddings for Gaussian Kernels on Manifolds
Soumik Dutta, Kunal Dutta
Flip Graphs for Eight Points in Three Dimensions Are Connected
Marc Khoury
Computing the minimal perimeter polygon for digital objects in the triangular tiling
Petra Wiederhold