Minimum-volume enclosing ellipsoids and core sets
From MaRDI portal
Publication:813369
DOI10.1007/s10957-005-2653-6zbMath1093.90039OpenAlexW2056124912MaRDI QIDQ813369
Piyush Kumar, E. Alper Yıldırım
Publication date: 8 February 2006
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.7222
Related Items
Non-probabilistic polygonal convex set model for structural uncertainty quantification ⋮ Computing minimum-volume enclosing ellipsoids for large datasets ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Quadrangulation of non-rigid objects using deformation metrics ⋮ Clustering via minimum volume ellipsoids ⋮ Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier ⋮ Sets that maximize probability and a related variational problem ⋮ Computing minimum-volume enclosing ellipsoids ⋮ Optimal Embedded and Enclosing Isosceles Triangles ⋮ A credible interval analysis method for uncertain structures under nonprobabilistic framework ⋮ A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids ⋮ Rank-two update algorithms for the minimum volume enclosing ellipsoid problem ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ Developments in differential game theory and numerical methods: Economic and management applications ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ Computing minimum-volume enclosing axis-aligned ellipsoids ⋮ Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem ⋮ An algebraic approach to continuous collision detection for ellipsoids ⋮ Estimation and asymptotics for buffered probability of exceedance ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ Uniqueness results for minimal enclosing ellipsoids ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids ⋮ Rounding of convex sets and efficient gradient methods for linear programming problems ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Fast subspace approximation via greedy least-squares ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Convex programming based spectral clustering ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Streaming algorithms for extent problems in high dimensions ⋮ Fast algorithms for the minimum volume estimator ⋮ Using enclosing ellipsoids in multiaxial fatigue strength criteria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Approximating the volume of convex bodies
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Approximate clustering via core-sets
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Minimum Covering Ellipses
- Determinant Maximization with Linear Matrix Inequality Constraints
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On self-concordant convex–concave functions
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- Faster core-set constructions and data stream algorithms in fixed dimensions
- Practical methods for shape fitting and kinetic data structures using core sets
- Approximate minimum enclosing balls in high dimensions using core-sets
- A geometric approach to optimal design theory
