Minimum volume covering ellipsoids

DOI10.21914/ANZIAMJ.V64.17956MaRDI QIDQ6950116zbMATH OpenFDO

Authors Elizabeth Harris

Publication date 31 July 2025

Published in The ANZIAM Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21914/ANZIAMJ.V64.17956

zbMATH Keywords

core setsD-optimal designlarge-scale optimisationleverage scoresminimum volume covering ellipsoidWolfe-Atwood algorithm

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Convex programming (90C25)

Cites work

• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• Computation of Minimum-Volume Covering Ellipsoids
• Computing minimum-volume enclosing ellipsoids for large datasets
• Ellipsoidal state estimation for dynamical systems
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• scientific article; zbMATH DE number 3526459 (Why is no real title available?)
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Minimum-volume ellipsoids. Theory and algorithms
• Minimum-volume enclosing ellipsoids and core sets
• Optimal design: Some geometrical aspects of D-optimality
• Pattern separation by convex programming
• Rounding of Polytopes in the Real Number Model of Computation
• Sequences converging to D-optimal designs of experiments
• Traces and Emergence of Nonlinear Programming

This page was built for publication: Minimum volume covering ellipsoids

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