Computing minimum-volume enclosing ellipsoids for large datasets

DOI10.1016/J.CSDA.2022.107452MaRDI QIDQ2129596zbMATH OpenOpenAlexWikidataFDO

Authors Samuel Rosa, Radoslav Harman

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)

Recommendations

• Computing minimum-volume enclosing ellipsoids
• An active-set algorithm for solving the minimum volume enclosing ellipsoid problems
• Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
• Computation of Minimum-Volume Covering Ellipsoids
• Fast algorithms for the minimum volume estimator

Cites work

• scientific article; zbMATH DE number 194744 (Why is no real title available?)
• scientific article; zbMATH DE number 800961 (Why is no real title available?)
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• A geometric approach to optimal design theory
• A statistical perspective on algorithmic leveraging
• An algorithm for optimal designs on a design space
• Computation of Minimum-Volume Covering Ellipsoids
• D-optimal designs via a cocktail algorithm
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Fast algorithms for the minimum volume estimator
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Minimum-volume ellipsoids. Theory and algorithms
• Minimum-volume enclosing ellipsoids and core sets
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• On greedy heuristics for computing D-efficient saturated subsets
• On optimal designs for nonlinear models: a general and efficient algorithm
• Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects
• Optimal design: Some geometrical aspects of D-optimality

Cited in

(2)

• A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
• Computing minimum-volume enclosing ellipsoids

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

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