arXiv Analytics

Sign in

arXiv:1703.09477 [math.OC]AbstractReferencesReviewsResources

Convergence of the Forward-Backward Algorithm: Beyond the Worst Case with the Help of Geometry

Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa

Published 2017-03-28Version 1

We provide a comprehensive study of the convergence of forward-backward algorithm under suitable geometric conditions leading to fast rates. We present several new results and collect in a unified view a variety of results scattered in the literature, often providing simplified proofs. Novel contributions include the analysis of infinite dimensional convex minimization problems, allowing the case where minimizers might not exist. Further, we analyze the relation between different geometric conditions, and discuss novel connections with a priori conditions in linear inverse problems, including source conditions, restricted isometry properties and partial smoothness.

Related articles: Most relevant | Search more
arXiv:1310.7063 [math.OC] (Published 2013-10-26, updated 2015-07-01)
On the Convergence of Decentralized Gradient Descent
arXiv:1805.06445 [math.OC] (Published 2018-05-16)
On the Convergence of the SINDy Algorithm
arXiv:0803.2211 [math.OC] (Published 2008-03-14, updated 2010-05-09)
On Conditions for Convergence to Consensus