Corpus ID: 14121549

# Convergence Rate of Frank-Wolfe for Non-Convex Objectives

@article{LacosteJulien2016ConvergenceRO,
title={Convergence Rate of Frank-Wolfe for Non-Convex Objectives},
author={S. Lacoste-Julien},
journal={ArXiv},
year={2016},
volume={abs/1607.00345}
}
• S. Lacoste-Julien
• Published 2016
• Mathematics, Computer Science
• ArXiv
• We give a simple proof that the Frank-Wolfe algorithm obtains a stationary point at a rate of $O(1/\sqrt{t})$ on non-convex objectives with a Lipschitz continuous gradient. Our analysis is affine invariant and is the first, to the best of our knowledge, giving a similar rate to what was already proven for projected gradient methods (though on slightly different measures of stationarity).
87 Citations

#### Topics from this paper.

Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets
• Computer Science, Mathematics
• AAAI
• 2019
• 1
• Highly Influenced
• PDF
Stochastic Frank-Wolfe for Composite Convex Minimization
• Computer Science, Mathematics
• NeurIPS
• 2019
• 2
• PDF
Stochastic Frank-Wolfe for Composite Convex Minimization
• Computer Science, Mathematics
• NeurIPS 2019
• 2019
• 5
A projection-free decentralized algorithm for non-convex optimization
• Mathematics, Computer Science
• 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
• 2016
• 6
• PDF
Stochastic Frank-Wolfe methods for nonconvex optimization
• Computer Science, Mathematics
• 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
• 2016
• 63
• Highly Influenced
• PDF
Active Set Complexity of the Away-Step Frank-Wolfe Algorithm
• Mathematics, Computer Science
• SIAM J. Optim.
• 2020
• 1
• PDF

#### References

SHOWING 1-10 OF 16 REFERENCES