📖
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Hedy Attouch, Jerome Bolte

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

Author / Organization:
Science & Mathematics Published 2007 Verification Pending

Overview & Synopsis

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 func- tions 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-time or geometric convergence, the decay estimates that are derived are of the type O(k−s), where s ∈ (0,+∞) depends on the flatness of the function.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Author / Organization Hedy Attouch, Jerome Bolte
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2007
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-230034
Original Source Link Visit Source Page on hal.science »