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

arXiv: Optimization and Control(2016)

引用 98|浏览17
暂无评分
摘要
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).
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要