Fetching the paper…
Reading the bibliography…
The Douglas-Rachford method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization problems.
Banach S (1922) Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund math 3(1):133–181
1922
Earlier work this paper cites.
Kaczmarz S (1937) Angenäherte Auflösung von Systemen linearer Gleichungen. Bull Int Acad Sci Pologne, A 35:355–357
1937
Earlier work this paper cites.
von Neumann J (1950) Functional Operators II: The Geometry of Orthogonal Spaces. Princeton University Press
1950
Earlier work this paper cites.
Douglas J, Rachford HH (1956) On the numerical solution of heat conduction problems in two and three space variables. Trans Amer Math Soc 82:421–439
1956
Earlier work this paper cites.
Halperin I (1962) The product of projection operators. Acta Sci Math 23:96–99
1962
Earlier work this paper cites.
Bregman LM (1965) The method of successive projection for finding a common point of convex sets. Soviet Math Dokl 162(3):688–692
1965
Earlier work this paper cites.
Opial Z (1967) Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bulletin of the American Mathematical Society 73(4):591–597
1967
Earlier work this paper cites.
Pazy A (1971) Asymptotic behavior of contractions in Hilbert space. Israel J Math 9:235–240
1971
Earlier work this paper cites.
Baillon JB, Bruck RE, Reich S (1978) On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houston J Math 4(1):1–9
1978
Earlier work this paper cites.
Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J Numer Anal 16(6):964–979
1979
Earlier work this paper cites.
Censor Y (1984) Iterative methods for convex feasibility problems. Ann Discrete Math 20:83–91
1984
Earlier work this paper cites.
Pierra G (1984) Decomposition through formalization in a product space. Math Program 28:96–115
1984
Earlier work this paper cites.
Eckstein J, Bertsekas DP (1992) On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math Program 55(1):293–318
1992
Earlier work this paper cites.
Deutsch F (2001) Best Approximation in Inner Product Spaces, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, vol 7. Springer-Verlag
2001
Earlier work this paper cites.
Bauschke HH, Combettes PL, Luke DR (2002) Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization. J Opt Soc Am A 19(7):1334–1345
2002
Earlier work this paper cites.
Elser V (2003) Phase retrieval by iterated projections. J Opt Soc Am A 20(1):40–55
2003
Earlier work this paper cites.
Bauschke HH, Combettes PL, Luke DR (2004) Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J Approx Theory 127(2):178–192
2004
Earlier work this paper cites.
Hundal HS (2004) An alternating projection that does not converge in norm. Nonlin Anal: Theory, Methods & Appl 57(1):35–61
2004
Earlier work this paper cites.
Elser V, Rankenburg I, Thibault P (2007) Searching with iterated maps. Proc Natl Acad Sci 104(2):418–423
2007
Cited alongside, same era.
Luke DR (2008) Finding best approximation pairs relative to a convex and a prox-regular set in a Hilbert space. SIAM J Optim 19(2):714–739
2008
Cited alongside, same era.
Schaad J (2010) Modeling the
2010
Cited alongside, same era.
Borwein JM, Sims B (2011) The Douglas–Rachford algorithm in the absence of convexity. In: Bauschke H, Burachik R, Combettes P, Elser V, Luke D, Wolkowicz H (eds) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer Optimization and Its Applications, vol 49, Springer, New York, pp 93–109
2011
Cited alongside, same era.
Svaiter BF (2011) On weak convergence of the Douglas–Rachford method. SIAM J Control Optim 49(1):280–287
2011
Cited alongside, same era.
Phan HM (2016) Linear convergence of the Douglas–Rachford method for two closed sets. Optim 65(2):369–385
2016
Later among the works it cites.
Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer
2017
Later among the works it cites.
Bauschke HH, Dao MN (2017) On the finite convergence of the Douglas–Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces. SIAM J Optim 27(1):507–537
2017
Later among the works it cites.
Bauschke HH, Moursi WM (2017) On the Douglas–Rachford algorithm. Math Program, Ser A 164(1–2):263–284
2017
Later among the works it cites.
Bauschke HH, Lukens B, Moursi WM (2017) Affine nonexpansive operators, Attouch–Théra duality and the Douglas–Rachford algorithm. Set-Valued Var Anal 25(3):481–505
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aragón Artacho FJ, Borwein JM (2013) Global convergence of a non-convex Douglas–Rachford iteration. J Glob Optim 57(3):753–769
2013
Cited alongside, same era.
Bauschke HH (2013) New demiclosedness principles for (firmly) nonexpansive operators. In: Computational and Analytical Mathematics, Springer, pp 19–28
2013
Cited alongside, same era.
Hesse R, Luke DR (2013) Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J Optim 23(4):2397–2419
2013
Cited alongside, same era.
Bauschke HH, Noll D (2014) On the local convergence of the Douglas–Rachford algorithm. Arch Math 102(6):589–600
2014
Cited alongside, same era.
Bauschke HH, Bello Cruz JY, Nghia TT, Phan HM, Wang X (2014) The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J Approx Theory 185:63–79
2014
Cited alongside, same era.
Borwein JM, Tam MK (2014) A cyclic Douglas–Rachford iteration scheme. J Optim Theory Appl 160(1):1–29
2014
Cited alongside, same era.
Hesse R, Luke DR, Neumann P (2014) Alternating projections and Douglas–Rachford for sparse affine feasibility. IEEE Transactions on Signal Processing 62(18):4868–4881
2014
Cited alongside, same era.
Borwein JM, Tam MK (2017) Reflection methods for inverse problems with applications to protein conformation determination. In: Aussel D, Lalitha C (eds) Generalized Nash Equilibrium Problems, Bilevel Programming and MPEC. Forum for Interdisciplinary Mathematics, Springer Singapore, Singapore, pp 83–100
2017
Later among the works it cites.
2017
Later among the works it cites.
Alwadani S, Bauschke HH, Moursi WM, Wang X (2018) On the asymptotic behaviour of the Aragón Artacho–Campoy algorithm. Oper Res Lett 46(6):585–587
2018
Later among the works it cites.
Aragón Artacho FJ, Censor Y, Gibali A (2018c) The cyclic Douglas–Rachford algorithm with
2018
Later among the works it cites.
Behling R, Bello Cruz JY, Santos L (2018) Circumcentering the Douglas–Rachford method. Numer Algor 78(3):759–776
2018
Later among the works it cites.
Borwein JM, Lindstrom SB, Sims B, Schneider A, Skerritt MP (2018) Dynamics of the Douglas–Rachford method for ellipses and
2018
Later among the works it cites.
Elser V (2018) The complexity of bit retrieval. IEEE Transactions on Information Theory 64(1):412–428
2018
Later among the works it cites.
Lindstrom SB, Sims B (2018) Survey: Sixty years of Douglas–Rachford. arXiv e-prints
2018
Later among the works it cites.
Tam MK (2018) Algorithms based on unions of nonexpansive maps. Optim Letters 12(5):1019–1027
2018
Later among the works it cites.
Thao NH (2018) A convergent relaxation of the Douglas–Rachford algorithm. Comput Optim Appl 70(3):841–863
2018
Later among the works it cites.
Bauschke HH, Dao MN, Lindstrom SB (2019) The Douglas–Rachford algorithm for a hyperplane and a doubleton. J Glob Optim pp 1–15, DOI:
2019
Closest in time.
Cegielski A (2012) Iterative Methods for Fixed Point Problems in Hilbert Spaces, Lecture Notes in Mathematics, vol 2057. Springer
2057
Closest in time.