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

DOI10.1007/S10589-010-9342-6zbMath1270.90072OpenAlexW2017930566MaRDI QIDQ434159

Wei-jie Cong, Feng Ye, Shui-sheng Zhou, Hong-Wei 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

zbMATH Keywords

approximation algorithmscomplexity analysiscore setsminimum volume ellipsoidsrank-two update algorithmssequential minimal optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem

Cites Work

• Unnamed Item
• Minimum-volume enclosing ellipsoids and core sets
• Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
• Geometric algorithms and combinatorial optimization
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• Factoring multivariate integral polynomials
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
• Improved Algorithms for Convex Minimization in Relative Scale
• Minimum Covering Ellipses
• Optimal design: Some geometrical aspects of D-optimality
• A random polynomial-time algorithm for approximating the volume of convex bodies
• 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
• A geometric approach to optimal design theory

This page was built for publication: Rank-two update algorithms for the minimum volume enclosing ellipsoid problem