A dykstra-like algorithm for two monotone operators

Pacific Journal of Optimization

Volumn 4, Issue 3, 2008, Pages 383-391

  Bauschke, Heinz H ^a   Combettes, Patrick L ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Dykstra's algorithm; Maximal monotone operator; Proximity operator; Resolvent; Von Neumann's algorithm

Indexed keywords

EID: 70349474718     PISSN: 13489151     EISSN: 13498169     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. H. Attouch and H. Brézis, Duality for the sum of convex functions in general Banach spaces, in Aspects of Mathematics and its Applications J.A. Barroso (ed.), North-Holland Math. Library, vol. 34, North-Holland, Amsterdam, The Netherlands, 1986, pp. 125-133.
2. H. Attouch, H. Riahi and M. Théra, Somme ponctuelle d'opérateurs maximaux monotones, Serdica Math. J. 22 (1996) 267-292.
3. H. Attouch and M. Théra, A general duality principle for the sum of two operators, J. Convex Anal. 3 (1996) 1-24.
4. J.-P. Aubin and H. Frankowska, Set-Valued Analysis. Birkhäuser, Boston, MA, 1990.
5. H.H. Bauschke and J.M. Borwein, Dykstra's alternating projection algorithm for two sets, J. Approx. Theory 79 (1994) 418-443.
6. H.H. Bauschke, P.L. Combettes and S. Reich, The asymptotic behavior of the composition of two resolvents, Nonlinear Anal. 60 (2005) 283-301.
7. J.P. Boyle and R.L. Dykstra, A method for finding projections onto the intersection of convex sets in Hilbert spaces, Lecture Notes in Statistics 37 (1986) 28-47.
8. L.M. Brègman, The method of successive projection for finding a common point of convex sets, Soviet Math.-Doklady 6 (1965) 688-692.
9. P.L. Combettes, Signal recovery by best feasible approximation, IEEE Trans. Image Process. 2 (1993) 269-271.
10. P.L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization 53 (2004) 475-504.
11. P.L. Combettes and V.R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul. 4 (2005) 1168-1200.
12. F. Deutsch, The method of alternating orthogonal projections, in Approximation Theory, Spline Functions and Application, Singh SP (ed.), Kluwer, The Netherlands, 1992, pp. 105-121.
13. F. Deutsch, Best Approximation in Inner Product Spaces. Springer-Verlag, New York, 2001.
14. R.L. Dykstra, An algorithm for restricted least squares regression, J. Amer. Stat. Assoc. 78 (1983) 837-842.
15. N. Gaffke and R. Mathar, A cyclic projection algorithm via duality, Metrika 36 (1989) 29-54.
16. H.S. Hundal, An alternating projection that does not converge in norm, Nonlinear Anal. 57 (2004) 35-61.
17. P.-L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal. 16 (1979) 964-979.
18. J.-J. Moreau, Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. France 93 (1965) 273-299.
19. R.T. Rockafellar, Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
20. R.T. Rockafellar and R.J.B. Wets, Variational Analysis. Springer-Verlag, New York, 1998.
21. S. Simons, Minimax and Monotonicity, Lecture Notes in Mathematics 1693. Springer-Verlag, New York, 1998.
22. P. Tseng, Dual coordinate ascent methods for non-strictly convex minimization, Math. Program. 59 (1993) 231-247.
23. J. von Neumann, On rings of operators. Reduction theory, Ann. of Math. 50 (1949) 401-485 (a reprint of lecture notes first distributed in 1933).
24. C. Zǎlinescu, Convex Analysis in General Vector Spaces. World Scientific, River Edge, NJ, 2002.