Abstract
We discuss the Douglas–Rachford algorithm to solve the feasibility problem for two closed sets A,B in \({\mathbb{R}^d}\) . We prove its local convergence to a fixed point when A,B are finite unions of convex sets. We also show that for more general nonconvex sets the scheme may fail to converge and start to cycle, and may then even fail to solve the feasibility problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aragón Artacho F.J., Borwein J.M., Tam M.K.: Recent results on Douglas–Rachford methods. Serdica Mathematical Journal 39, 313–330 (2013)
H.H. Bauschke and P.L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Space, Springer, 2011.
Bauschke H.H., Combettes P.L., Luke D.R.: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. Journal of Approximation Theory 127, 178–192 (2004)
Bauschke H.H., Luke D.R., Phan H.M., Wang X.: Restricted normal cones and the method of alternating projections: theory. Set-valued and Variational Analysis 21, 431–473 (2013)
Bauschke H.H., Noll D.: On cluster points of alternating projections. Serdica Mathematical Journal 39, 355–364 (2013)
H.H. Bauschke, and V.R. Koch, Projection methods: Swiss Army knives for solving feasibility and best approximation problems with halfspaces, Contemporary Mathematics, in press.
Douglas J., Rachford H.H.: On the numerical solution of heat conduction problems in two or three space variables. Transactions of the AMS 82, 421–439 (1956)
Elser V., Rankenburg I., Thibault P.: Searching with iterated maps. Proceedings of the National Academy of Sciences of the USA 104, 418–423 (2007)
Elsner L., Koltracht I., Neumann M.: Convergence of sequential and asynchronous nonlinear paracontractions. Numerische Mathematik 62, 305–319 (1992)
Hesse R., Luke D.R.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM Journal on Optimization 23(4), 2397–2419 (2013)
R. Hesse, D.R. Luke, and P. Neumann Projection methods for sparse affine feasibility: results and counterexamples, arXiv:1307.2009v1 [math.OC] 8 Jul 2013
Lions P.-L., Mercier B.: Splitting algorithms for the sum of two nonlinear operators. SIAM Journal on Numerical Analysis 16, 964–979 (1679)
D. Noll and A. Rondepierre On local convergence of the method of alternating projections, arXiv:1312.5681v1 [math.OC] 19 Dec 2013
W.I. Zangwill Nonlinear Programming, Prentice Hall, 1969.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bauschke, H.H., Noll, D. On the local convergence of the Douglas–Rachford algorithm. Arch. Math. 102, 589–600 (2014). https://doi.org/10.1007/s00013-014-0652-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-014-0652-2