Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
arXiv:1809.00761 · doi:10.1137/18M121160X
Abstract
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two maximally monotone operators. Although this algorithm is well understood when the involved operators are monotone or strongly monotone, the convergence theory for weakly monotone settings is far from being complete. In this paper, we propose an adaptive Douglas-Rachford splitting algorithm for the sum of two operators, one of which is strongly monotone while the other one is weakly monotone. With appropriately chosen parameters, the algorithm converges globally to a fixed point from which we derive a solution of the problem. When one operator is Lipschitz continuous, we prove global linear convergence, which sharpens recent known results.
Final version for SIAM Journal on Optimization
References in corpus (9)
- Convergence rate analysis for averaged fixed point iterations in the presence of Hölder regularity
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Global Behavior of the Douglas-Rachford Method for a Nonconvex Feasibility Problem
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm
- The Douglas-Rachford algorithm in the affine-convex case
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- Linear Convergence of Projection Algorithms
- Douglas-Rachford splitting for a Lipschitz continuous and a strongly monotone operator
Cited by in corpus (4)
- Generalized monotone operators and their averaged resolvents
- Doubly relaxed forward-Douglas--Rachford splitting for the sum of two nonconvex and a DC function
- An adaptive splitting algorithm for the sum of three operators
- Asymptotic behavior of a nonautonomous evolution equation governed by a quasi-nonexpansive operator