Computing minimum-volume enclosing ellipsoids for large datasets

DOI10.1016/j.csda.2022.107452OpenAlexW4212966019WikidataQ114191861 ScholiaQ114191861MaRDI QIDQ2129596

Radoslav Harman, Samuel Rosa

Publication date: 22 April 2022

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2022.107452

zbMATH Keywords

algorithm\(D\)-optimal designtall dataminimum-volume enclosing ellipsoid

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• D-optimal designs via a cocktail algorithm
• Minimum-volume enclosing ellipsoids and core sets
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• On greedy heuristics for computing D-efficient saturated subsets
• Fast algorithms for the minimum volume estimator
• Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• Minimum-Volume Ellipsoids
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Optimal design: Some geometrical aspects of D-optimality
• An algorithm for optimal designs on a design space
• Computation of Minimum-Volume Covering Ellipsoids
• On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
• 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: Computing minimum-volume enclosing ellipsoids for large datasets