Convergence of Descent Optimization Algorithms under Polyak-\L ojasiewicz-Kurdyka Conditions
\begin{abstract} {This paper develops a comprehensive convergence analysis for generic classes of descent algorithms in nonsmooth and nonconvex optimization under several conditions of the Polyak-\L ojasiewicz-Kurdyka (PLK) type. Along other results, we prove the finite termination of generic algorithms under the PLK conditions with lower exponents. Specifications are given to establish new convergence rates for … Read more