|
Scientific Part
Mathematics
The Lezanski – Polyak – Lojasiewicz inequality and the convergence of the gradient projection algorithm
M. V. Balashov V. A. Trapeznikov Institute of Control Sciences, 65 Profsoyuznaya St., Moscow 117977, Russia
Abstract:
We consider the Lezanski – Polyak – Lojasiewicz inequality for a real-analytic function on a real-analytic compact manifold without boundary in finite-dimensional Euclidean space. This inequality emerged in 1963 independently in works of three authors: Lezanski and Lojasiewicz from Poland and Polyak from the USSR. The inequality is appeared to be a very useful tool in the convergence analysis of the gradient methods, firstly in unconstrained optimization and during the past few decades in problems of constrained optimization. Basically, it is applied for a smooth in a certain sense function on a smooth in a certain sense manifold. We propose the derivation of the inequality from the error bound condition of the power type on a compact real-analytic manifold. As an application, we prove the convergence of the gradient projection algorithm of a real analytic function on a real analytic compact manifold without boundary. Unlike known results, our proof gives explicit dependence of the error via parameters of the problem: the power in the error bound condition and the constant of proximal smoothness first of all. Here we significantly use a technical fact that a smooth compact manifold without boundary is a proximally smooth set.
Key words:
Lezanski – Polyak – Lojasiewicz inequality, error bound condition, proximal smoothness, gradient projection algorithm, real-analytic function.
Received: 20.08.2022 Accepted: 27.10.2022
Citation:
M. V. Balashov, “The Lezanski – Polyak – Lojasiewicz inequality and the convergence of the gradient projection algorithm”, Izv. Saratov Univ. Math. Mech. Inform., 23:1 (2023), 4–10
Linking options:
https://www.mathnet.ru/eng/isu963 https://www.mathnet.ru/eng/isu/v23/i1/p4
|
|