Aragón Artacho, Francisco Javier, Censor, Yair, Gibali, Aviv
The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
Optimization Methods and Software. 2019, 34(4): 875-889. doi:10.1080/10556788.2018.1504049
URI: http://hdl.handle.net/10045/92793
DOI: 10.1080/10556788.2018.1504049
ISSN: 1055-6788 (Print)
Abstract: 
The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm.
Keywords:Douglas–Rachford, Reflections, Feasibility problems, r-sets-Douglas–Rachford operator
Taylor & Francis
info:eu-repo/semantics/article