Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
From MaRDI portal
Publication:5219705
DOI10.1287/moor.2017.0910zbMath1440.90048arXiv1512.06142OpenAlexW2962906893WikidataQ129311375 ScholiaQ129311375MaRDI QIDQ5219705
Daniel J. Rodríguez, Javier F. Peña
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.06142
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Related Items
Linearly convergent away-step conditional gradient for non-strongly convex functions ⋮ Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning ⋮ Generalized self-concordant analysis of Frank-Wolfe algorithms ⋮ The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ The condition number of a function relative to a set ⋮ Avoiding bad steps in Frank-Wolfe variants ⋮ Restarting Frank-Wolfe: faster rates under Hölderian error bounds
Cites Work
- Unnamed Item
- Unnamed Item
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Introductory lectures on convex optimization. A basic course.
- Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- On the von Neumann and Frank--Wolfe Algorithms with Away Steps
- A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result
- Some comments on Wolfe's ‘away step’
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
