arXiv Analytics

Sign in

arXiv:2411.11628 [math.OC]AbstractReferencesReviewsResources

Linear Convergence of the Proximal Gradient Method for Composite Optimization Under the Polyak-Łojasiewicz Inequality and Its Variant

Qingyuan Kong, Rujun Jiang, Yihan He

Published 2024-11-18Version 1

We study the linear convergence rates of the proximal gradient method for composite functions satisfying two classes of Polyak-{\L}ojasiewicz (PL) inequality: the PL inequality, the variant of PL inequality defined by the proximal map-based residual. Using the performance estimation problem, we either provide new explicit linear convergence rates or improve existing complexity bounds for minimizing composite functions under the two classes of PL inequality.

Related articles: Most relevant | Search more
arXiv:2102.12816 [math.OC] (Published 2021-02-25)
Composite Optimization with Coupling Constraints via Proximal Gradient Method in Partially Asynchronous Networks
arXiv:1007.3535 [math.OC] (Published 2010-07-20)
Proximity for Sums of Composite Functions
arXiv:2404.10993 [math.OC] (Published 2024-04-17)
A Proximal Gradient Method with an Explicit Line search for Multiobjective Optimization