Computing minimum-volume enclosing ellipsoids

DOI10.1007/s12532-023-00242-8zbMath1524.68331MaRDI QIDQ6062882

Nathaniel Bowman, Michael T. Heath

Publication date: 2 December 2023

Published in: Mathematical Programming Computation (Search for Journal in Brave)

zbMATH Keywords

Newton's methodkurtosisminimum-volume enclosing ellipsoid

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Methods of quasi-Newton type (90C53) Computational aspects of data analysis and big data (68T09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
• Minimum-volume enclosing ellipsoids and core sets
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Löwner-John ellipsoids
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Sequences converging to D-optimal designs of experiments
• Minimum-Volume Ellipsoids
• Sinh-arcsinh distributions
• Optimal design: Some geometrical aspects of D-optimality
• Large-scale linearly constrained optimization
• 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