Minimum-Volume Ellipsoids
From MaRDI portal
Publication:2825979
DOI10.1137/1.9781611974386zbMath1360.90006OpenAlexW4253029839MaRDI QIDQ2825979
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1137/1.9781611974386
ellipsoidsmatrix analysisminimum-volume ellipsoidsellipsoidal cylindersminimum-area problemsminimum-volume problems
Convex programming (90C25) Interior-point methods (90C51) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (14)
Parallel processing of the Build Hull algorithm to address the large-scale DEA problem ⋮ Computing minimum-volume enclosing ellipsoids for large datasets ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Optimal Data Fitting: A Moment Approach ⋮ Fenchel Duality and a Separation Theorem on Hadamard Manifolds ⋮ Computing minimum-volume enclosing ellipsoids ⋮ Nonlinear set membership filter with state estimation constraints via consensus-ADMM ⋮ First-order methods for convex optimization ⋮ Relatively Smooth Convex Optimization by First-Order Methods, and Applications ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Approximating Nonnegative Polynomials via Spectral Sparsification ⋮ A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ Dual optimal design and the Christoffel-Darboux polynomial
Uses Software
This page was built for publication: Minimum-Volume Ellipsoids
