Tight Linear Convergence Rate Bounds for Douglas-Rachford Splitting and ADMM

arXiv1503.00887MaRDI QIDQ6259587FDOQ6259587

Publication date: 3 March 2015

Abstract: Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) can be used to solve convex optimization problems that consist of a sum of two functions. Convergence rate estimates for these algorithms have received much attention lately. In particular, linear convergence rates have been shown by several authors under various assumptions. One such set of assumptions is strong convexity and smoothness of one of the functions in the minimization problem. The authors recently provided a linear convergence rate bound for such problems. In this paper, we show that this rate bound is tight for many algorithm parameter choices.

This page was built for publication: Tight Linear Convergence Rate Bounds for Douglas-Rachford Splitting and ADMM

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