The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
Jonathan Michael Borwein, Matthew K. Tam · arXiv (Cornell University) · 2013
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.