Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

DOI10.1287/moor.1090.0408zbMath1218.90156OpenAlexW2108976672MaRDI QIDQ3169071

Robert M. Freund, Jorge R. Vera

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/55961

zbMATH Keywords

computational complexityconvex optimizationellipsoid algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Convex functions and convex programs in convex geometry (52A41) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization ⋮ Randomized interior point methods for sampling and optimization

This page was built for publication: Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model