On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

DOI10.1287/MOOR.7.2.253MaRDI QIDQ4739662zbMATH OpenOpenAlexFDO

Authors Michael J. Todd

Publication date 1982

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

Full work available at URL https://doi.org/10.1287/moor.7.2.253

zbMATH Keywords

ellipsoid algorithmminimum volume ellipsoids

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25)

Cited in

(11)

• The ellipsoid algorithm using parallel cuts
• Using two successive subgradients in the ellipsoid method for nonlinear programming
• On the complexity of some basic problems in computational convexity. I. Containment problems
• The ellipsoid method and its implications
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• A class of rank-two ellipsoid algorithms for convex programming
• Variable metric relaxation methods, part II: The ellipsoid method
• Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
• Some results on centers of polytopes
• A subgradient supported ellipsoid method for convex multiobjective optimization problems
• The ellipsoid method redux

This page was built for publication: On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739662)