A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis
From MaRDI portal
Publication:6301795
DOI10.1007/S10957-019-01525-8arXiv1805.07336WikidataQ128094636 ScholiaQ128094636MaRDI QIDQ6301795FDOQ6301795
Authors: V. A. Adona, M. L. N. Gonçalves, J. G. Melo 
Publication date: 18 May 2018
Abstract: This paper proposes a partially inexact alternating direction method of multipliers for computing approximate solution of a linearly constrained convex optimization problem. This method allows its first subproblem to be solved inexactly using a relative approximate criterion, whereas a proximal term is added to its second subproblem in order to simplify it. A stepsize parameter is included in the updating rule of the Lagrangian multiplier to improve its computational performance. Pointwise and ergodic interation-complexity bounds for the proposed method are established. To the best of our knowledge, this is the first time that complexity results for an inexact ADMM with relative error criteria has been analyzed. Some preliminary numerical experiments are reported to illustrate the advantages of the new method.
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Monotone operators and generalizations (47H05) Decomposition methods (49M27)
This page was built for publication: A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301795)
