A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm

DOI10.1137/0306032zbMath0186.24002OpenAlexW2078735805MaRDI QIDQ5580057

Michael D. Canon, Clifton D. Jun. Cullum

Publication date: 1968

Published in: SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0306032

zbMATH Keywords

operations research

Related Items (35)

On the convexity of integrals of multivalued mappings. Applications in control theory ⋮ Linearly convergent away-step conditional gradient for non-strongly convex functions ⋮ The Cyclic Block Conditional Gradient Method for Convex Optimization Problems ⋮ Minimizing pseudoconvex functions on convex compact sets ⋮ Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces ⋮ Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ Riemannian optimization via Frank-Wolfe methods ⋮ Asymptotic linear convergence of fully-corrective generalized conditional gradient methods ⋮ First-order methods for convex optimization ⋮ Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ A minimum-cost multicommodity network flow problem concerning imports and exports ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ Primal and dual predicted decrease approximation methods ⋮ Mixed finite element methods for unilateral problems: convergence analysis and numerical studies ⋮ Finding the nearest point in A polytope ⋮ Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions ⋮ Unnamed Item ⋮ Minimization methods with constraints ⋮ Conditional gradient algorithms with open loop step size rules ⋮ A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization ⋮ Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees ⋮ Complexity of linear minimization and projection on some sets ⋮ Generalized Conditional Gradient for Sparse Estimation ⋮ Numerical implementation of two nonconforming finite element methods for unilateral contact ⋮ Linear convergence of accelerated conditional gradient algorithms in spaces of measures ⋮ Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs ⋮ Efficiency and proper efficiency in vector maximization with respect to cones ⋮ On the Effectiveness of Richardson Extrapolation in Data Science ⋮ First-order methods for the convex hull membership problem ⋮ A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes ⋮ Avoiding bad steps in Frank-Wolfe variants ⋮ Finiteness in restricted simplicial decomposition ⋮ Partial linearization methods in nonlinear programming ⋮ Restarting Frank-Wolfe: faster rates under Hölderian error bounds

This page was built for publication: A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm