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 solvefeasibilityproblems 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
