On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
From MaRDI portal
Publication:2381536
DOI10.1016/j.dam.2007.02.013zbMath1151.90516OpenAlexW2133629339MaRDI QIDQ2381536
Michael J. Todd, E. Alper Yıldırım
Publication date: 18 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23405
Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Computing minimum-volume enclosing ellipsoids for large datasets, Optimal Data Fitting: A Moment Approach, SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES, Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach, Overlap of convex polytopes under rigid motion, Sets that maximize probability and a related variational problem, Problem of controlling a group of quadrocopters when moving along a given curve, Perspective reconstruction of a spheroid from an image plane ellipse, A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids, Rank-two update algorithms for the minimum volume enclosing ellipsoid problem, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, Application of piecewise quadratic value functions to the approximate solution of a nonlinear target control problem, On the elimination of inessential points in the smallest enclosing ball problem, Robust online Hamiltonian learning, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, Extremal general affine surface areas, Computing minimum-volume enclosing axis-aligned ellipsoids, Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem, A portfolio selection model using fuzzy returns, An algebraic approach to continuous collision detection for ellipsoids, 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, Fast subspace approximation via greedy least-squares, Approximate solution of the target control problem with a nonlinearity depending on one state variable, Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem, High posterior density ellipsoids of quantum states, A branch-and-bound algorithm for the exact optimal experimental design problem, Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies, Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization, Performance analysis of greedy algorithms for minimising a maximum mean discrepancy, Fast algorithms for the minimum volume estimator
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- Minimum-volume enclosing ellipsoids and core sets
- Geometric algorithms and combinatorial optimization
- 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
- Sequences converging to D-optimal designs of experiments
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
- Approximate clustering via core-sets
- The Ellipsoid Method Generates Dual Variables
- Some comments on Wolfe's ‘away step’
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Minimum Covering Ellipses
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Optimal design: Some geometrical aspects of D-optimality
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Determinant Maximization with Linear Matrix Inequality Constraints
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On self-concordant convex–concave functions
- On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid
- 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
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Approximate minimum enclosing balls in high dimensions using core-sets
- The Sequential Generation of $D$-Optimum Experimental Designs
- A geometric approach to optimal design theory
