Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
From MaRDI portal
Publication:968187
DOI10.1016/j.dam.2009.12.003zbMath1237.90181MaRDI QIDQ968187
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.003
approximation algorithms; complexity analysis; core sets; minimum volume ellipsoids; axis-aligned ellipsoids
90C25: Convex programming
Related Items
Cites Work
- Minimum-volume enclosing ellipsoids and core sets
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Computing minimum-volume enclosing axis-aligned ellipsoids
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids