On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
arXiv:1604.04657 · doi:10.1137/16M1071079
Abstract
Solving feasibility problems is a central task in mathematics and the applied sciences. One particularly successful method is the Douglas-Rachford algorithm. In this paper, we provide many new conditions sufficient for finite convergence. Numerous examples illustrate our results.
References in corpus (7)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
- Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
- Global convergence of a non-convex Douglas-Rachford iteration
- 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
Cited by in corpus (9)
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm
- Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions
- Linear Convergence of Projection Algorithms
- A feasibility approach for constructing combinatorial designs of circulant type
- The Douglas--Rachford algorithm for a hyperplane and a doubleton
- A Lyapunov function construction for a non-convex Douglas-Rachford iteration
- A finitely convergent circumcenter method for the Convex Feasibility Problem