Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
From MaRDI portal
Publication:5459815
DOI10.1080/10556780701589669zbMATH Open1146.90047OpenAlexW2064380440MaRDI QIDQ5459815FDOQ5459815
Authors: Selin Damla Ahipaşaoğlu, Peng Sun, Michael J. Todd 
Publication date: 29 April 2008
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701589669
Recommendations
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
- Computing minimum-volume enclosing ellipsoids
- Computation of Minimum-Volume Covering Ellipsoids
- An active-set algorithm for solving the minimum volume enclosing ellipsoid problems
- Computing minimum-volume enclosing axis-aligned ellipsoids
Cites Work
- The Equivalence of Two Extremum Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal and Efficient Designs of Experiments
- The Sequential Generation of $D$-Optimum Experimental Designs
- Rounding of Polytopes in the Real Number Model of Computation
- Computation of Minimum-Volume Covering Ellipsoids
- Integer Programming with a Fixed Number of Variables
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- D-Optimality for Regression Designs: A Review
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Sequences converging to D-optimal designs of experiments
- Minimum-volume enclosing ellipsoids and core sets
- Some comments on Wolfe's ‘away step’
Cited In (34)
- Efficient formulations for pricing under attraction demand models
- Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- First-order methods for convex optimization
- Relatively smooth convex optimization by first-order methods, and applications
- Computing minimum-volume enclosing ellipsoids for large datasets
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- On directional Whitney inequality
- On the minimum volume simplex enclosure problem for estimating a linear mixing model
- Polytope conditioning and linear convergence of the Frank-Wolfe algorithm
- Enhancing pure-pixel identification performance via preconditioning
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
- Computing minimum-volume enclosing ellipsoids
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Fast algorithms for the minimum volume estimator
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- A branch-and-bound algorithm for the exact optimal experimental design problem
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Solving conic systems via projection and rescaling
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- On the elimination of inessential points in the smallest enclosing ball problem
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
- Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- On the von Neumann and Frank-Wolfe algorithms with away steps
This page was built for publication: Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459815)
