Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
From MaRDI portal
Publication:5459815
DOI10.1080/10556780701589669zbMath1146.90047MaRDI 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
Relatively Smooth Convex Optimization by First-Order Methods, and Applications, On the elimination of inessential points in the smallest enclosing ball problem, Linear convergence of accelerated conditional gradient algorithms in spaces of measures, On directional Whitney inequality, Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies, Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm, Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization, A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, Computing minimum-volume enclosing ellipsoids, First-order methods for convex optimization, Rank-two update algorithms for the minimum volume enclosing ellipsoid problem, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem, Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations, Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach, Solving conic systems via projection and rescaling, A branch-and-bound algorithm for the exact optimal experimental design problem, Performance analysis of greedy algorithms for minimising a maximum mean discrepancy, Computing minimum-volume enclosing ellipsoids for large datasets, A Newton Frank-Wolfe method for constrained self-concordant minimization, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Efficient formulations for pricing under attraction demand models, Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem, Fast algorithms for the minimum volume estimator, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier, A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria, Nonlinear set membership filter with state estimation constraints via consensus-ADMM, Enhancing Pure-Pixel Identification Performance via Preconditioning
Cites Work
- 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
- Unnamed Item
- Unnamed Item
