Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods II: Dual Strict Complementarity and Firm Convexity of the Components Give the Error Bound for f(Ax) + g(x)Research Paper
Proximal gradient methods are used to minimize an objective with one smooth part and one convex part whose proximal map can be evaluated. A small proximal gradient step is a practical stopping signal, but it indicates proximity to an optimizer only when the objective has an appropriate error bound. Section 4 of Drusvyatskiy and Lewis gives conditions for…