The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems
Optimization and Control
2018-05-28 v3
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.
Cite
@article{arxiv.1310.2195,
title = {The Cyclic Douglas-Rachford Method for Inconsistent Feasibility Problems},
author = {Jonathan M. Borwein and Matthew K. Tam},
journal= {arXiv preprint arXiv:1310.2195},
year = {2018}
}
Comments
13 pages, 2 figures; references updated, figure 2 corrected