Computing minimum-volume enclosing ellipsoids for large datasets
From MaRDI portal
Publication:2129596
DOI10.1016/J.CSDA.2022.107452OpenAlexW4212966019WikidataQ114191861 ScholiaQ114191861MaRDI QIDQ2129596FDOQ2129596
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
Cites Work
- On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
- D-optimal designs via a cocktail algorithm
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- An algorithm for optimal designs on a design space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Title not available (Why is that?)
- Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects
- Computation of Minimum-Volume Covering Ellipsoids
- Optimal design: Some geometrical aspects of D-optimality
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- A geometric approach to optimal design theory
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Minimum-volume enclosing ellipsoids and core sets
- Minimum-volume ellipsoids. Theory and algorithms
- Fast algorithms for the minimum volume estimator
- On greedy heuristics for computing D-efficient saturated subsets
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
Cited In (2)
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)
