Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem

DOI10.1016/j.dam.2009.12.003zbMath1237.90181OpenAlexW2027225546MaRDI QIDQ968187

Wei-jie Cong, Hong-Wei Liu

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

zbMATH Keywords

approximation algorithmscomplexity analysiscore setsminimum volume ellipsoidsaxis-aligned ellipsoids

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Rank-two update algorithms for the minimum volume enclosing ellipsoid problem

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

This page was built for publication: Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem