paper

The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems

arXiv:1310.2195

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.

arXiv comment13 pages, 2 figures; references updated, figure 2 corrected

References in corpus (1)

Cited by in corpus (7)