Minimum-volume ellipsoids. Theory and algorithms
From MaRDI portal
Publication:2825979
Recommendations
Cited in
(35)- Minimum-volume ellipsoidal approximation of the sum of two ellipsoids
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- scientific article; zbMATH DE number 4131965 (Why is no real title available?)
- On the algorithm of Petunin confidence ellipsoid construction
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- Parallel processing of the Build Hull algorithm to address the large-scale DEA problem
- Duality of ellipsoidal approximations via semi-infinite programming
- The polytope of optimal approximate designs: extending the selection of informative experiments
- scientific article; zbMATH DE number 926786 (Why is no real title available?)
- Relatively smooth convex optimization by first-order methods, and applications
- New subset selection algorithms for low rank approximation: offline and online
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- Computation of Minimum-Volume Covering Ellipsoids
- Mixed-integer linear programming for computing optimal experimental designs
- On greedy heuristics for computing D-efficient saturated subsets
- On the elimination of inessential points in the smallest enclosing ball problem
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Optimal data fitting: a moment approach
- Fenchel Duality and a Separation Theorem on Hadamard Manifolds
- First-order methods for convex optimization
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- Approximating nonnegative polynomials via spectral sparsification
- Computing minimum-volume enclosing ellipsoids for large datasets
- Conditional minimum volume ellipsoid with application to multiclass discrimination
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- Computing minimum-volume enclosing ellipsoids
- An algorithm for constructing of minimal volume ellipsoid
- Various modifications of optimum algorithm of construction of the minimal area ellipse
- scientific article; zbMATH DE number 1445342 (Why is no real title available?)
- On equivalence of major relaxation methods for minimum ellipsoid covering intersection of ellipsoids
- Dual optimal design and the Christoffel-Darboux polynomial
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)
