Journal
MATHEMATICAL PROGRAMMING
Volume 116, Issue 1-2, Pages 5-16Publisher
SPRINGER
DOI: 10.1007/s10107-007-0133-5
Keywords
proximal algorithm; Lujasiewicz inequality; subanalytic functions
Ask authors/readers for more resources
We study the convergence of the proximal algorithm applied to nonsmooth functions that satisfy the Lojasiewicz inequality around their generalized critical points. Typical examples of functions complying with these conditions are continuous semialgebraic or subanalytic functions. Following Lojasiewicz's original idea, we prove that any bounded sequence generated by the proximal algorithm converges to some generalized critical point. We also obtain convergence rate results which are related to the flatness of the function by means of Lojasiewicz exponents. Apart from the sharp and elliptic cases which yield finite or geometric convergence, the decay estimates that are derived are of the type O(k(-s)), where s is an element of (0, + infinity) depends on the flatness of the function.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available