Linear convergence of the Douglas–Rachford method for two closed sets

References

• Bauschke HH, Borwein JM. On projections algorithms for solving convex feasibility problems. SIAM Rev. 1993;38:367–426.
   Web of Science ®Google Scholar
• Douglas J, Rachford HH. On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 1956;82:421–439.
   Google Scholar
• Demanet L, Zhang X. Eventual linear convergence of the Douglas–Rachford iteration for basis pursuit. Math. Comput. to appear. arXiv:1301.0542.
   Google Scholar
• Hesse R, Luke DR. Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J. Optim. 2013;23:2397–2419.
   Web of Science ®Google Scholar
• Hesse R, Luke DR, Neumann P. Alternating projections and Douglas–Rachford for sparse affine feasibility. IEEE Trans. Signal Process. 2014;62:4868–4881.
   Web of Science ®Google Scholar
• Svaiter BF. On weak convergence of the Douglas–Rachford method. SIAM J. Control Optim. 2011;49:280–287.
   Web of Science ®Google Scholar
• Lions P-L, Mercer B. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 1979;16:964–979.
   Web of Science ®Google Scholar
• Borwein JM, Sims B. The Douglas–Rachford algorithm in the absence of convexity. In: Bauschke HH, Burachik R, Combettes PL, Elser V, Luke DR, Wolkowicz H, editors. Fixed-point algorithms for inverse problems in science and engineering. Vol. 49, Springer optimization and Its applications. New York (NY): Springer; 2011. p. 93–109.
   Google Scholar
• Aragón Artacho FJ, Borwein JM. Global convergence of a nonconvex Douglas–Rachford iteration. J. Global Optim. 2013;57:753–769.
   Web of Science ®Google Scholar
• Bauschke HH, Bello Cruz JY, Nghia TTA, et al. The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory. 2014;185:63–79.
   Web of Science ®Google Scholar
• Bauschke HH, Noll D, Phan HM. Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 2015;421:1–20.
   Web of Science ®Google Scholar
• Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer; 2011.
   Google Scholar
• Mordukhovich BS. Variational analysis and generalized differentiation I. Berlin: Springer; 2006.
   Google Scholar
• Rockafellar RT, Wets B. Variational analysis. New York (NY): Springer; 2009.
   Google Scholar
• Bauschke HH, Luke DR, Phan HM, et al. Restricted normal cones and the method of alternating projections: theory. Set-Valued Variational Anal. 2013;21:431–473.
   Web of Science ®Google Scholar
• Bauschke HH, Luke DR, Phan HM, et al. Restricted normal cones and the method of alternating projections: applications. Set-Valued Variational Anal. 2013;21:475–501.
   Web of Science ®Google Scholar
• Bauschke HH, Phan HM, Wang X. The method of alternating relaxed projections for two nonconvex sets. Vietnam J. Math. 2014;42:421–450.
   Google Scholar
• Kruger AY, Thao NH. About uniform regularity of collections of sets. Serdica Math. J. 2013;39:287–312.
   Google Scholar
• Kruger AY. About regularity of collections of sets. Set-Valued Variational Anal. 2006;14:187–206.
   Web of Science ®Google Scholar
• Bauschke HH, Borwein JM, Li W. Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization. Math. Program. Ser. A. 1999;86:135–160.
   Web of Science ®Google Scholar
• Lewis AS, Luke DR, Malick J. Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 2009;9:485–513.
   Web of Science ®Google Scholar
• Bauschke HH. Projection algorithms and monotone operators [Ph.D. thesis]. Burnaby (BC): Simon Fraser University; 1996.
   Google Scholar
• Bauschke HH, Koch VR. Swiss army knives for solving feasibility and best approximation problems with halfspaces. In: Infinite products of operators and their applications. Vol. 636, Contemporary Mathematics. Haifa; 2015.
   Google Scholar