Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition V: Under the Proximal-PL Inequality, Proximal-Gradient Converges at Rate (1 − μ/L)^kResearch Paper
Many problems in machine learning and signal processing minimize a smooth loss plus a simple non-smooth regularizer: -regularized least squares, group-sparse regression, and constrained problems written with an indicator function. The standard algorithm for this composite form is the proximal-gradient method, a gradient step on the smooth part…