Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
DOI10.1007/S10589-010-9342-6zbMATH Open1270.90072OpenAlexW2017930566MaRDI QIDQ434159FDOQ434159
Authors: Weijie Cong, Feng Ye, Shuisheng Zhou, Hongwei Liu 
Publication date: 10 July 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9342-6
Recommendations
- An active-set algorithm for solving the minimum volume enclosing ellipsoid problems
- Minimum-volume enclosing ellipsoids and core sets
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
- Computing minimum-volume enclosing axis-aligned ellipsoids
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
approximation algorithmscomplexity analysiscore setsminimum volume ellipsoidsrank-two update algorithmssequential minimal optimization
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Minimum Covering Ellipses
- Optimal design: Some geometrical aspects of D-optimality
- Improved algorithms for convex minimization in relative scale
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- A geometric approach to optimal design theory
- Factoring multivariate integral polynomials
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Minimum-volume enclosing ellipsoids and core sets
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
Cited In (5)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
- An active-set algorithm for solving the minimum volume enclosing ellipsoid problems
- Title not available (Why is that?)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
This page was built for publication: Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434159)
