Mathematical Programming

, Volume 116, Issue 1, pp 5-16

First online:

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

  • Hedy AttouchAffiliated withI3M UMR CNRS 5149, Université Montpellier II Email author 
  • , Jérôme BolteAffiliated withEquipe Combinatoire et Optimisation (UMR 7090), Case 189, Université Pierre et Marie Curie

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We study the convergence of the proximal algorithm applied to nonsmooth functions that satisfy the Łjasiewicz inequality around their generalized critical points. Typical examples of functions complying with these conditions are continuous semialgebraic or subanalytic functions. Following Łjasiewicz’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 Łjasiewicz 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 ∈ (0, + ∞) depends on the flatness of the function.


Proximal algorithm Łjasiewicz inequality Subanalytic functions

Mathematics Subject Classification (2000)

90C26 47N10 90C30