Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier

DOI10.1287/moor.24.1.193zbMath0977.90034OpenAlexW2048609007MaRDI QIDQ2757590

Kurt M. Anstreicher

Publication date: 26 November 2001

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

Full work available at URL: https://semanticscholar.org/paper/dee6a25bad634831ae329e94f5999d3b26050371

zbMATH Keywords

roundingvolumetric barriershallow-cut ellipsoid algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25)

Related Items

A note on approximation of a ball by polytopes ⋮ Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Rounding of convex sets and efficient gradient methods for linear programming problems