Abstract
AbstractThe Douglas–Rachford method is a splitting method frequently employed for finding zeros of sums of maximally monotone operators. When the operators in question are normal cone operators, the iterated process may be used to solve feasibility problems of the following form: Find $x\in \bigcap _{k=1}^{N}S_{k}$. The success of the method in the context of closed, convex, nonempty sets $S_{1},\ldots ,S_{N}$ is well known and understood from a theoretical standpoint. However, its performance in the nonconvex context is less well understood, yet it is surprisingly impressive. This was particularly compelling to Jonathan M. Borwein who, intrigued by Elser, Rankenburg and Thibault’s success in applying the method to solving sudoku puzzles, began an investigation of his own. We survey the current body of literature on the subject, and we summarize its history. We especially commemorate Professor Borwein’s celebrated contributions to the area.
Publisher
Cambridge University Press (CUP)
Reference140 articles.
1. Linear convergence of the Douglas–Rachford method for two closed sets
2. [45] Borwein, J. M. and Giladi, O. , ‘Ergodic behaviour of a Douglas–Rachford operator away from the origin’, Preprint, (2017), arXiv:1708.09068.
3. [136] Tam, M. K. , ‘Iterative projection and reflection methods: theory and practice’, PhD Thesis, University of Newcastle, (2016).
4. A new proximal point iteration that converges weakly but not in norm
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献