Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods

标题
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
作者
关键词
Nonconvex nonsmooth optimization, Semi-algebraic optimization, Tame optimization, Kurdyka–Łojasiewicz inequality, Descent methods, Relative error, Sufficient decrease, Forward–backward splitting, Alternating minimization, Proximal algorithms, Iterative thresholding, Block-coordinate methods, o-minimal structures, 34G25, 47J25, 47J30, 47J35, 49M15, 49M37, 65K15, 90C25, 90C53
出版物
MATHEMATICAL PROGRAMMING
Volume 137, Issue 1-2, Pages 91-129
出版商
Springer Nature
发表日期
2011-08-19
DOI
10.1007/s10107-011-0484-9

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

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

Explore

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More