From error bounds to the complexity of first-order descent methods for convex functions

Title
From error bounds to the complexity of first-order descent methods for convex functions
Authors
Keywords
Error bounds, Convex minimization, Forward-backward method, KL inequality, Complexity of first-order methods, LASSO, Compressed sensing, 90C06, 90C25, 90C60, 65K05
Journal
MATHEMATICAL PROGRAMMING
Volume 165, Issue 2, Pages 471-507
Publisher
Springer Nature
Online
2016-11-30
DOI
10.1007/s10107-016-1091-6

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started