Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
From MaRDI portal
Publication:5459815
DOI10.1080/10556780701589669zbMath1146.90047OpenAlexW2064380440MaRDI QIDQ5459815
Michael J. Todd, Selin Damla Ahipaşaoğlu, Peng Sun
Publication date: 29 April 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701589669
Related Items (30)
Computing minimum-volume enclosing ellipsoids for large datasets ⋮ A Newton Frank-Wolfe method for constrained self-concordant minimization ⋮ Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Enhancing Pure-Pixel Identification Performance via Preconditioning ⋮ On directional Whitney inequality ⋮ Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach ⋮ Solving conic systems via projection and rescaling ⋮ Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier ⋮ 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 ⋮ 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 ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ Efficient formulations for pricing under attraction demand models ⋮ Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem ⋮ A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization ⋮ Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum-volume enclosing ellipsoids and core sets
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Sequences converging to D-optimal designs of experiments
- Integer Programming with a Fixed Number of Variables
- The Equivalence of Two Extremum Problems
- Some comments on Wolfe's ‘away step’
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- D-Optimality for Regression Designs: A Review
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- Optimal and Efficient Designs of Experiments
- The Sequential Generation of $D$-Optimum Experimental Designs
This page was built for publication: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
