On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming

Bingsheng He, Liusheng Hou, Xiaoming YUAN

Research output: Contribution to journalArticlepeer-review

50 Citations (Scopus)

Abstract

The augmented Lagrangian method (ALM) is a benchmark for solving a convex minimization model with linear constraints. We consider the special case where the objective is the sum of m functions without coupled variables. For solving this separable convex minimization model, it is usually required to decompose the ALM subproblem at each iteration into m smaller subproblems, each of which only involves one function in the original objective. Easier subproblems capable of taking full advantage of the functions' properties individually could thus be generated. In this paper, we focus on the case where full Jacobian decomposition is applied to ALM subproblems, i.e., all the decomposed ALM subproblems are eligible for parallel computation at each iteration. For the first time, we show, by an example, that the ALM with full Jacobian decomposition could be divergent. To guarantee the convergence, we suggest combining a relaxation step and the output of the ALM with full Jacobian decomposition. A novel analysis is presented to illustrate how to choose refined step sizes for this relaxation step. Accordingly, a new splitting version of the ALM with full Jacobian decomposition is proposed. We derive the worst-case O(1/k) convergence rate measured by the iteration complexity (where k represents the iteration counter) in both the ergodic and nonergodic senses for the new algorithm. Finally, some numerical results are reported to show the efficiency of the new algorithm.

Original languageEnglish
Pages (from-to)2274-2312
Number of pages39
JournalSIAM Journal on Optimization
Volume25
Issue number4
DOIs
Publication statusPublished - 2015

Scopus Subject Areas

  • Software
  • Theoretical Computer Science

User-Defined Keywords

  • Augmented Lagrangian method
  • Contraction methods
  • Convergence rate
  • Convex programming
  • Jacobian decomposition
  • Operator splitting methods

Fingerprint

Dive into the research topics of 'On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming'. Together they form a unique fingerprint.

Cite this