An active-set algorithm for solving the minimum volume enclosing ellipsoid problems

DOI10.13413/J.CNKI.JDXBLXB.2015.02.07MaRDI QIDQ3195781zbMATH OpenFDO

Authors Weijie Cong

Publication date 28 October 2015

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2015.02.07

zbMATH Keywords

active-set strategylarge-scale datalinear convergenceminimum volume enclosing ellipsoid

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• scientific article; zbMATH DE number 6907388
• Computation of Minimum-Volume Covering Ellipsoids
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
• Computing minimum-volume enclosing axis-aligned ellipsoids

Cited in

(7)

• Computing minimum-volume enclosing ellipsoids for large datasets
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• Computation of Minimum-Volume Covering Ellipsoids
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem

This page was built for publication: An active-set algorithm for solving the minimum volume enclosing ellipsoid problems

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