ADMM for monotone operators: convergence analysis and rates

DOI10.1007/S10444-018-9619-3arXiv1705.01913MaRDI QIDQ6286298

Publication date: 4 May 2017

Abstract: We propose in this paper a unifying scheme for several algorithms from the literature dedicated to the solving of monotone inclusion problems involving compositions with linear continuous operators in infinite dimensional Hilbert spaces. We show that a number of primal-dual algorithms for monotone inclusions and also the classical ADMM numerical scheme for convex optimization problems, along with some of its variants, can be embedded in this unifying scheme. While in the first part of the paper convergence results for the iterates are reported, the second part is devoted to the derivation of convergence rates obtained by combining variable metric techniques with strategies based on suitable choice of dynamical step sizes.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05)

This page was built for publication: ADMM for monotone operators: convergence analysis and rates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286298)