The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems

Abstract

We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is possibly empty.

13 pages, 2 figures; references updated, figure 2 corrected

References in corpus (1)

• The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Cited by in corpus (7)

• Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems
• On the linear convergence of the circumcentered-reflection method
• Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions
• Reflection methods for inverse problems with application to protein conformation determination
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
• New Douglas-Rachford algorithmic structures and their convergence analyses
• Norm Convergence of Realistic Projection and Reflection Methods