On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems

References

• [1] Attouch H, Théra M (1996) A general duality principle for the sum of two operators. J. Convex Anal. 3(1):1–24.Google Scholar
• [2] Banjac G (2021) On the minimal displacement vector of the Douglas–Rachford operator. Oper. Res. Lett. 49(2):197–200.Crossref, Google Scholar
• [3] Banjac G, Lygeros J (2021) On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization. Optim. Lett. 15:2719–2732.Crossref, Google Scholar
• [4] Banjac G, Goulart P, Stellato B, Boyd S (2019) Infeasibility detection in the alternating direction method of multipliers for convex optimization. J. Optim. Theory Appl. 183(2):490–519.Crossref, Google Scholar
• [5] Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd ed. (Springer, New York).Crossref, Google Scholar
• [6] Bauschke HH, Moursi WM (2016) The Douglas–Rachford algorithm for two (not necessarily intersecting) affine subspaces. SIAM J. Optim. 26(2):968–985.Crossref, Google Scholar
• [7] Bauschke HH, Moursi WM (2017) On the Douglas–Rachford algorithm. Math. Programming 164:263–284.Crossref, Google Scholar
• [8] Bauschke HH, Moursi WM (2020) On the behavior of the Douglas–Rachford algorithm for minimizing a convex function subject to a linear constraint. SIAM J. Optim. 30(3):2559–2576.Crossref, Google Scholar
• [9] Bauschke HH, Combettes PL, Luke DR (2004) Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approximation Theory 127(2):178–192.Crossref, Google Scholar
• [10] Bauschke HH, Dao MN, Moursi WM (2015) On Fejér monotone sequences and nonexpansive mappings. Linear Nonlinear Anal. 1:287–295.Google Scholar
• [11] Bauschke HH, Dao MM, Moursi WM (2016) The Douglas–Rachford algorithm in the affine-convex case. Oper. Res. Lett. 44(3):379–382.Crossref, Google Scholar
• [12] Bauschke HH, Hare WL, Moursi WM (2014) Generalized solutions for the sum of two maximally monotone operators. SIAM J. Control Optim. 52(2):1034–1047.Crossref, Google Scholar
• [13] Bauschke HH, Hare WL, Moursi WM (2016) On the range of the Douglas–Rachford operator. Math. Oper. Res. 41(3):884–897.Link, Google Scholar
• [14] Bauschke HH, Moffat SM, Wang X (2013) Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings. Math. Programming 139:55–70.Crossref, Google Scholar
• [15] Bauschke HH, Boţ RI, Hare WL, Moursi WM (2012) Attouch-Théra duality revisited: Paramonotonicity and operator splitting. J. Approximation Theory 164(8):1065–1084.Crossref, Google Scholar
• [16] Beck A (2017) First-Order Methods in Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• [17] Borwein JM, Lindstrom SB, Sims B, Schneider A, Skerritt MP (2018) Dynamics of the Douglas–Rachford method for ellipses and p-spheres. Set-Valued Variational Anal. 26:385–403.Crossref, Google Scholar
• [18] Bruck RE, Reich S (1977) Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston J. Math. 3:459–470.Google Scholar
• [19] Douglas J, Rachford HH (1956) On the numerical solution of heat conduction problems in two and three space variables. Trans. AMS 82:421–439.Google Scholar
• [20] Eckstein J (1989) Splitting methods for monotone operators with applications to parallel optimization. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• [21] Eckstein J, Svaiter BF (2008) A family of projective splitting methods for the sum of two maximal monotone operators. Math. Programming 111:173–199.Crossref, Google Scholar
• [22] Gabay D (1983) Applications of the method of multipliers to variational inequalities. Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, vol. 15. (North-Holland, Amsterdam), 299–331.Crossref, Google Scholar
• [23] Iusem AN (1998) On some properties of paramonotone operators. J. Convex Anal. 5(2):269–278.Google Scholar
• [24] Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numerical Anal. 16(6):964–979.Crossref, Google Scholar
• [25] Liu Y, Ryu EK, Yin W (2019) A new use of Douglas–Rachford splitting for identifying infeasible, unbounded, and pathological conic programs. Math. Programming 177:225–253.Crossref, Google Scholar
• [26] Mercier B (1980) Inéquations Variationnelles de la Mécanique. Publications Mathématiques d’Orsay, no. 80.01, Université de Paris-XI, Orsay, France.Google Scholar
• [27] Minty GJ (1962) Monotone (nonlinear) operators in Hilbert spaces. Duke Math. J. 29(3):341–346.Crossref, Google Scholar
• [28] Moursi WM (2016) The Douglas–Rachford operator in the possibly inconsistent case: static properties and dynamic behaviour. PhD thesis, University of British Columbia, Vancouver.Google Scholar
• [29] Moursi WM (2022) The range of the Douglas–Rachford operator in infinite-dimensional Hilbert spaces, Preprint, submitted June 14, https://arxiv.org/abs/2206.07204.Google Scholar
• [30] Moursi WM, Zinchenko Y (2019) A note on the equivalence of operator splitting methods. Splitting Algorithms, Monotone Operator Theory, and Applications (Springer, New York), 331–349.Crossref, Google Scholar
• [31] Pazy A (1971) Asymptotic behavior of contractions in Hilbert space. Israel J. Math. 9:235–240.Crossref, Google Scholar
• [32] Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [33] Rockafellar RT (1970) On the maximal monotonicity of subdifferential mappings. Pacific J. Math. 33(1):209–216.Crossref, Google Scholar
• [34] Ryu EK, Liu Y, Yin W (2019) Douglas–Rachford splitting and ADMM for pathological convex optimization. Comput. Optim. Appl. 74:747–778.Crossref, Google Scholar
• [35] Svaiter BF (2011) On weak convergence of the Douglas-Rachford method. SIAM J. Control Optim. 49(1):280–287.Crossref, Google Scholar
• [36] Zarantonello EH (1971) Projections on convex sets in Hilbert space and spectral theory. Contributions to Nonlinear Functional Analysis (Academic Press, New York), 237–424.Crossref, Google Scholar