Convergence of a Relaxed Inertial Forward–Backward Algorithm for Structured Monotone Inclusions

Abstract

In a Hilbert space H, we study the convergence properties of a class of relaxed inertial forward–backward algorithms. They aim to solve structured monotone inclusions of the form Ax+ Bx∋ 0 where A: H→ 2 H is a maximally monotone operator and B: H→ H is a cocoercive operator. We extend to this class of problems the acceleration techniques initially introduced by Nesterov, then developed by Beck and Teboulle in the case of structured convex minimization (FISTA). As an important element of our approach, we develop an inertial and parametric version of the Krasnoselskii–Mann theorem, where joint adjustment of the inertia and relaxation parameters plays a central role. This study comes as a natural extension of the techniques introduced by the authors for the study of relaxed inertial proximal algorithms. An illustration is given to the inertial Nash equilibration of a game combining non-cooperative and cooperative aspects.