Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
From MaRDI portal
Publication:968187
DOI10.1016/J.DAM.2009.12.003zbMATH Open1237.90181OpenAlexW2027225546MaRDI QIDQ968187FDOQ968187
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
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
approximation algorithmscomplexity analysiscore setsminimum volume ellipsoidsaxis-aligned ellipsoids
Cites Work
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- 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 axis-aligned ellipsoids
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)
