An inexact proximal generalized alternating direction method of multipliers

V. A. Adona (), M. L. N. Gonçalves () and J. G. Melo ()
Additional contact information
V. A. Adona: Universidade Federal de Goias
M. L. N. Gonçalves: Universidade Federal de Goias
J. G. Melo: Universidade Federal de Goias

Computational Optimization and Applications, 2020, vol. 76, issue 3, No 2, 647 pages

Abstract: Abstract This paper proposes and analyzes an inexact variant of the proximal generalized alternating direction method of multipliers (ADMM) for solving separable linearly constrained convex optimization problems. In this variant, the first subproblem is approximately solved using a relative error condition whereas the second one is assumed to be easy to solve. In many ADMM applications, one of the subproblems has a closed-form solution; for instance, $$\ell _1$$ ℓ 1 regularized convex composite optimization problems. The proposed method possesses iteration-complexity bounds similar to its exact version. More specifically, it is shown that, for a given tolerance $$\rho >0$$ ρ > 0 , an approximate solution of the Lagrangian system associated to the problem under consideration is obtained in at most $$\mathcal {O}(1/\rho ^2)$$ O ( 1 / ρ 2 ) (resp. $$\mathcal {O}(1/\rho )$$ O ( 1 / ρ ) in the ergodic case) iterations. Numerical experiments are presented to illustrate the performance of the proposed scheme.

Keywords: Generalized alternating direction method of multipliers; Convex program; Relative error criterion; Pointwise iteration-complexity; Ergodic iteration-complexity; 47H05; 49M27; 90C25; 90C60; 65K10 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-020-00191-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:76:y:2020:i:3:d:10.1007_s10589-020-00191-1

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-020-00191-1

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().