The Douglas-Rachford algorithm in the affine-convex case
arXiv:1505.06408 · doi:10.1016/j.orl.2016.03.010
Abstract
The Douglas-Rachford algorithm is a simple yet effective method for solving convex feasibility problems. However, if the underlying constraints are inconsistent, then the convergence theory is incomplete. We provide convergence results when one constraint is an affine subspace. As a consequence, we extend a result by Spingarn from halfspaces to general closed convex sets admitting least-squares solutions.
References in corpus (1)
Cited by in corpus (12)
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm
- On the linear convergence of the circumcentered-reflection method
- 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
- The Douglas--Rachford algorithm for a hyperplane and a doubleton
- On the Asymptotic Behavior of the Douglas-Rachford and Proximal-Point Algorithms for Convex Optimization
- On the Minimal Displacement Vector of the Douglas-Rachford Operator
- On Fejér monotone sequences and nonexpansive mappings
- Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems