Quasiconvex programming
zbMATH Open1124.90023MaRDI QIDQ5290264FDOQ5290264
Authors: David Eppstein 
Publication date: 28 April 2006
Full work available at URL: http://www.msri.org/communications/books/Book52/
Recommendations
Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational aspects related to convexity (52B55) Inequalities and extremum problems in real or complex geometry (51M16) Polyhedra and polytopes; regular figures, division of spaces (51M20) Geometric constructions in real or complex geometry (51M15)
Cited In (13)
- Title not available (Why is that?)
- Outer approximation for integer nonlinear programs via decision diagrams
- Disciplined quasiconvex programming
- Optimal location of transportation devices
- Title not available (Why is that?)
- Linear programming relaxation for quasiconvex programming
- Fixed points of polarity type operators
- On the resolution of certain discrete univariate max-min problems
- Quasiconvex Jensen divergences and quasiconvex Bregman divergences
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- Optimization methods for frame conditioning and application to graph Laplacian scaling
- Summation-by-parts operators with minimal dispersion error for coarse grid flow calculations
- Title not available (Why is that?)
This page was built for publication: Quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5290264)
