Abstract
The introduction of the Hessian damping in the continuous version of Nesterov's accelerated gradient method provides, by temporal discretization, fast proximal gradient algorithms where the oscillations are significantly attenuated. We will extend these results to the maximally monotone case. We rely on the technique introduced by Attouch-Peypouquet (Math. Prog. 2019), where the maximally monotone operator is replaced by its Yosida approximation with an appropriate adjustment of the regularization parameter. In a general Hilbert framework, we obtain the weak convergence of the iterates to equilibria, and the rapid convergence of the discrete velocities to zero. By specializing these algorithms to convex minimization, we obtain the convergence rate o 1/k 2 of the values, and the rapid convergence of the gradients towards zero.