Minimum-volume ellipsoids. Theory and algorithms
DOI10.1137/1.9781611974386zbMATH Open1360.90006OpenAlexW4253029839MaRDI QIDQ2825979FDOQ2825979
Authors: Michael J. Todd 
Publication date: 14 October 2016
Published in: MOS SIAM Series on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974386
Recommendations
matrix analysisellipsoidsminimum-volume ellipsoidsellipsoidal cylindersminimum-area problemsminimum-volume problems
Convex programming (90C25) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Length, area, volume and convex sets (aspects of convex geometry) (52A38)
Cited In (35)
- Computation of Minimum-Volume Covering Ellipsoids
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
- Approximating nonnegative polynomials via spectral sparsification
- An algorithm for constructing of minimal volume ellipsoid
- Various modifications of optimum algorithm of construction of the minimal area ellipse
- Dual optimal design and the Christoffel-Darboux polynomial
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- First-order methods for convex optimization
- Optimal data fitting: a moment approach
- Relatively smooth convex optimization by first-order methods, and applications
- On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids
- Title not available (Why is that?)
- Computing minimum-volume enclosing ellipsoids for large datasets
- Duality of ellipsoidal approximations via semi-infinite programming
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- Conditional minimum volume ellipsoid with application to multiclass discrimination
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- Computing minimum-volume enclosing ellipsoids
- Mixed-integer linear programming for computing optimal experimental designs
- Minimum-volume ellipsoidal approximation of the sum of two ellipsoids
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
- Fenchel Duality and a Separation Theorem on Hadamard Manifolds
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- The polytope of optimal approximate designs: extending the selection of informative experiments
- New subset selection algorithms for low rank approximation: offline and online
- On the elimination of inessential points in the smallest enclosing ball problem
- On the algorithm of Petunin confidence ellipsoid construction
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- Title not available (Why is that?)
- On greedy heuristics for computing D-efficient saturated subsets
- Title not available (Why is that?)
Uses Software
This page was built for publication: Minimum-volume ellipsoids. Theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825979)
