On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid

DOI10.1287/moor.7.2.253zbMath0503.90065OpenAlexW2034124193MaRDI QIDQ4739662

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

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

Related Items (10)

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

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