Optimization Online


An inertial alternating direction method of multipliers

Radu Ioan Bot(radu.bot***at***univie.ac.at)
Ernö Robert Csetnek(ernoe.robert.csetnek***at***univie.ac.at)

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 \cite{b-c-h-inertial}, 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.

Keywords: inertial ADMM algorithm, inertial Douglas-Rachford splitting, maximally monotone operator, resolvent, subdifferential, convex optimization, Fenchel duality

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )


Download: [PDF]

Entry Submitted: 04/17/2014
Entry Accepted: 04/17/2014
Entry Last Modified: 04/17/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society