Abstract
In a Hilbert space setting, we analyze the convergence properties of a new class of proximal ADMM algorithms with inertial features. They aim to quickly solve convex structured minimization problems with linear constraint. As a basic ingredient, we use the maximally monotone operator M which is associated with the Lagrangian formulation of the problem. We specialize to this operator the inertial proximal algorithm recently introduced by Attouch and Peypouquet (Math. Prog. 2019) to resolve general monotone inclusions. This gives an inertial proximal ADMM algorithm where the extrapolation step takes into account recent advances concerning the accelerated gradient method of Nesterov. Based on an appropriate adjustment of the viscosity and proximal parameters, we analyze the fast convergence properties of the algorithm, as well as the convergence of the iterates to saddle points of the Lagrangian function. Among the perspectives, we outline a new direction of research, linked to the introduction of the Hessian damping in the algorithms.