Computing minimum-volume enclosing ellipsoids

DOI10.1007/S12532-023-00242-8MaRDI QIDQ6062882zbMATH OpenFDO

Authors Nathaniel Bowman, Michael T. Heath

Publication date 2 December 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S12532-023-00242-8

zbMATH Keywords

kurtosisminimum-volume enclosing ellipsoidNewton's method

Mathematics Subject Classification ID

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

Recommendations

• Computing minimum-volume enclosing axis-aligned ellipsoids
• Computation of Minimum-Volume Covering Ellipsoids
• Minimum-volume ellipsoids. Theory and algorithms
• Computing minimum-volume enclosing ellipsoids for large datasets
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Minimum-volume enclosing ellipsoids and core sets
• An algorithm for constructing of minimal volume ellipsoid
• Finding minimum volume circumscribing ellipsoids using generalized copositive programming
• Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem

Cites work

• A geometric approach to optimal design theory
• Computation of Minimum-Volume Covering Ellipsoids
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• scientific article; zbMATH DE number 3145759 (Why is no real title available?)
• scientific article; zbMATH DE number 6973983 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Large-scale linearly constrained optimization
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Löwner-John ellipsoids
• Minimum-volume ellipsoids. Theory and algorithms
• Minimum-volume enclosing ellipsoids and core sets
• Optimal design: Some geometrical aspects of D-optimality
• Rounding of Polytopes in the Real Number Model of Computation
• Sequences converging to D-optimal designs of experiments
• Sinh-arcsinh distributions
• Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden

Cited in

(9)

• A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
• Computing minimum-volume enclosing ellipsoids for large datasets
• Computing a minimum-width cubic and hypercubic shell
• An algorithm for constructing of minimal volume ellipsoid
• A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
• scientific article; zbMATH DE number 1445342 (Why is no real title available?)
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Stochastic modeling of nonlinear ellipsoidal debris dispersion in suborbital breakup events

This page was built for publication: Computing minimum-volume enclosing ellipsoids

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