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

DOI10.1016/J.DAM.2009.12.003MaRDI QIDQ968187zbMATH OpenOpenAlexFDO

Authors Weijie Cong, Hongwei 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)

Recommendations

• Computing minimum-volume enclosing axis-aligned ellipsoids
• Computation of Minimum-Volume Covering Ellipsoids
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• Minimum-volume enclosing ellipsoids and core sets

Cites work

• Computation of Minimum-Volume Covering Ellipsoids
• Computing minimum-volume enclosing axis-aligned ellipsoids
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Minimum-volume enclosing ellipsoids and core sets
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Rounding of Polytopes in the Real Number Model of Computation

Cited in

(10)

• An algorithm for constructing of minimal volume ellipsoid
• Various modifications of optimum algorithm of construction of the minimal area ellipse
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Minimum-volume enclosing ellipsoids and core sets
• Computing minimum-volume enclosing ellipsoids
• Computing minimum-volume enclosing axis-aligned ellipsoids
• A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids

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

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