An inertial alternating direction method of multipliers

Abstract

In the context of convex optimization problems in Hilbert spaces, we induce inertial effects into the classical ADMM numerical scheme and obtain in this way so-called inertial ADMM algorithms, the convergence properties of which we investigate into detail. To this aim we make use of the inertial version of the Douglas-Rachford splitting method for monotone inclusion problems recently introduced in [12], in the context of concomitantly solving a convex minimization problem and its Fenchel dual. The convergence of both sequences of the generated iterates and of the objective function values is addressed. We also show how the obtained results can be extended to the treating of convex minimization problems having as objective a finite sum of convex functions.

References in corpus (2)

• Inertial Douglas-Rachford splitting for monotone inclusion problems
• An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

Cited by in corpus (12)

• An inertial forward-backward algorithm for monotone inclusions
• Convergence Analysis of Projection Method for Variational Inequalities
• An inertial three-operator splitting algorithm with applications to image inpainting
• Geometry of First-Order Methods and Adaptive Acceleration
• Inertial primal-dual algorithms for structured convex optimization
• A general inertial proximal point method for mixed variational inequality problem
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Penalty schemes with inertial effects for monotone inclusion problems
• Proximal primal-dual best approximation algorithm with memory
• Convergence analysis of an inexact inertial Krasnoselskii-Mann algorithm with applications
• Convergence analysis of a relaxed inertial alternating minimization algorithm with applications
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions