Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method

Abstract

We analyze the convergence rate of the monotone accelerated proximal gradient method, which can be used to solve structured convex composite optimization problems. A linear convergence rate is established when the smooth part of the objective function is strongly convex, without knowledge of the strong convexity parameter. This is the fastest convergence rate known for this algorithm. As a byproduct, we also establish the boundedness of the iterates in the convex setting, and prove that the limit points of the iterates are all minimizers of the objective function.