Abstract
The problem of finding a zero of the sum of two maximally monotone operators is of central importance in optimization. One successful method to find such a zero is the Douglas–Rachford algorithm which iterates a firmly nonexpansive operator constructed from the resolvents of the given monotone operators. In the context of finding minimizers of convex functions, the resolvents are actually proximal mappings. Interestingly, as pointed out by Eckstein in 1989, the Douglas–Rachford operator itself may fail to be a proximal mapping. We consider the class of symmetric linear relations that are maximally monotone and prove the striking result that the Douglas–Rachford operator is generically not a proximal mapping.
Similar content being viewed by others
Notes
A linear relation on X is set-valued map from X to X such that its graph is a linear subspace of \(X\times X\). In relationship to the present paper, we refer the reader to [4] for more on maximally monotone linear relations. Furthermore, a resolvent \(J_A\) is linear if and only if \(A\in \mathcal {L}\) by [3, Theorem 2.1(xviii)].
See [18] for further information on porous sets.
References
Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, New York (2003)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)
Bauschke, H.H., Moffat, S.M., Wang, X.: Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality. Set-Valued Var. Anal. 20, 131–153 (2012)
Bauschke, H.H., Wang, X., Yao, L.: On Borwein–Wiersma decompositions of monotone linear relations. SIAM J. Optim. 20, 2636–2652 (2010)
Borwein, J.M.: Fifty years of maximal monotonicity. Optim. Lett. 4, 473–490 (2010)
Borwein, J.M., Vanderwerff, J.D.: Convex Functions: Constructions, Characterizations and Counterexamples. Cambridge University Press, Cambridge (2010)
Borwein, J.M., Zhu, Q.J.: Techniques of Variational Analysis. Springer, New York (2005)
Boţ, R.I.: Conjugate Duality in Convex Optimization. Springer, New York (2010)
Burachik, R.S., Iusem, A.N.: Set-Valued Mappings and Enlargements of Monotone Operators. Springer, New York (2008)
Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward–backward splitting. Multiscale Model. Simul. 4, 1168–1200 (2005)
Eckstein, J.: Splitting Methods for Monotone Operators with Applications to Parallel Optimization, Ph.D. thesis. Massachusetts Institute of Technology, Cambridge (1989)
Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293–318 (1992)
Goebel, K., Reich, S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Marcel Dekker, New York (1984)
Güler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403–419 (1991)
Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964–979 (1979)
Mordukhovich, B.S., Nam, N.M.: An Easy Path to Convex Analysis and Applications. Morgan & Claypool Publishers, San Rafael (2014)
Moreau, J.-J.: Proximité et dualité dans un espace hilbertien. Bulletin de la Société Mathématique de France 93, 273–299 (1965)
Reich, S., Zaslavski, A.J.: Genericity in Nonlinear Analysis. Springer, New York (2014)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)
Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, Springer, Berlin, corrected 3rd printing (2009)
Schaad, J.: Modeling the 8-Queens Problem and Sudoku using an Algorithm based on Projections onto Nonconvex Sets, Master’s thesis, The University of British Columbia, (2010)
Simons, S.: From Hahn-Banach to Monotonicity. Springer, New York (2008)
Acknowledgments
The authors thank Patrick Combettes and two anonymous referees for their comments. HHB was partially supported by the Natural Sciences and Engineering Research Council of Canada and by the Canada Research Chair Program. XW was partially supported by the Natural Sciences and Engineering Research Council of Canada.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Terry Rockafellar on the occasion of his 80th birthday.
Rights and permissions
About this article
Cite this article
Bauschke, H.H., Schaad, J. & Wang, X. On Douglas–Rachford operators that fail to be proximal mappings. Math. Program. 168, 55–61 (2018). https://doi.org/10.1007/s10107-016-1076-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-016-1076-5
Keywords
- Douglas–Rachford algorithm
- Firmly nonexpansive mapping
- Maximally monotone operator
- Nowhere dense set
- Proximal mapping
- Resolvent