Convergence rate of a relaxed inertial proximal algorithm for convex minimization

In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.