Solving monotone inclusions via compositions of nonexpansive averaged operators

Optimization

Volumn 53, Issue 5-6, 2004, Pages 475-504

  Combettes, Patrick L ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Averaged operator; Douglas rachford method; Forward backward method; Monotone inclusion; Monotone operator; Proximal point algorithm

Indexed keywords

EID: 13244295576     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331930412331327157     Document Type: Conference Paper

References (61)

1. F. Acker and M.A. Prestel (1980). Convergence d'un schéma de minimisation alternée. Annales de la Faculté des Sciences de Toulouse - Série 5, 2, 1-9.
2. H. Attouch and M. Théra (1996). A general duality principle for the sum of two operators. Journal of Convex Analysis, 3, 1-24.
3. J.P. Aubin and H. Frankowska (1990). Set-Valued Analysis. Birkhäuser, Boston, MA.
4. J.B. Baillon, R.E. Bruck and S. Reich (1978). On the asymptotic behavior of nonexpansive mappings and semigroups. Houston Journal of Mathematics, 4, 1-9.
5. J.B. Baillon and G. Haddad (1977). Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones. Israel Journal of Mathematics, 26, 137-150.
6. A.B. Bakušinskiǐ and B.T. Polyak (1974). The solution of variational inequalities. Soviet Mathematics Doklady, 15, 1705-1710.
7. H.H. Bauschke (2003). The composition of finitely many projections onto closed convex sets in Hilbert space is asymptotically regular. Proceedings of the American Mathematical Society, 131, 141-146.
8. H.H. Bauschke and J.M. Borwein (1994). Dykstra's alternating projection algorithm for two sets. Journal of Approximation Theory, 79, 418-443.
9. H.H. Bauschke and J.M. Borwein (1996). On projection algorithms for solving convex feasibility problems. SIAM Review, 38, 367-426.
10. H.H. Bauschke, J.M. Borwein and A.S. Lewis (1997). The method of cyclic projections for closed convex sets in Hilbert space. Contemporary Mathematics, 204, 1-38.
11. H.H. Bauschke and P.L. Combettes (2001). A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Mathematics of Operations Research, 26, 248-264.
12. H.H. Bauschke, P.L. Combettes and D.R. Luke (2004). Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. Journal of Approximation Theory, 127, 178-192.
13. H. Brézis and P.L. Lions (1978). Produits infinis de résolvantes. Israel Journal of Mathematics, 29, 329-345.
14. F.E. Browder (1967). Convergence theorems for sequences of nonlinear operators in Banach spaces. Mathematische Zeitschrift, 100, 201-225.
15. R.E. Bruck and S. Reich (1977). Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houston Journal of Mathematics, 3, 459-470.
16. G. Cimmino (1938). Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. La Ricerca Scientifica (Roma), 1, 326-333.
17. P.L. Combettes (1994). Inconsistent signal feasibility problems: least-squares solutions in a product space. IEEE. Transactions on Signal Processing, 42, 2955-2966.
18. P.L. Combettes (1995). Construction d'un point fixe commun à une famille de contractions fermes. Comptes Rendus de l'Académie des Sciences de Paris, Série 1 (Mathématique), 320, 1385-1390.
19. P.L. Combettes (1997). Hilbertian convex feasibility problem: convergence of projection methods. Applied Mathematics and Optimization, 35, 311-330.
20. P.L. Combettes (2001). Fejér monotonicity in convex optimization. In: C.A. Floudas and P.M. Pardalos (Eds.), Encyclopedia of Optimization, Vol. 2, pp. 106-114. Kluwer, Boston, MA.
21. P.L. Combettes (2001). Quasi-Fejérian analysis of some optimization algorithms. In: D. Butnariu, Y. Censor and S. Reich (Eds.), Inherently Parallel Algorithms for Feasibility and Optimization, pp. 115-152. Elsevier, New York.
22. P.L. Combettes and P. Bondon (1999). Hard-constrained inconsistent signal feasibility problems. IEEE. Transactions on Signal Processing, 47, 2460-2468.
23. A.R. De Pierro and A.N. Iusem (1985). A parallel projection method for finding a common point of a family of convex sets. Pesquisa Operacional, 5, 1-20.
24. J. Douglas and H.H. Rachford (1956). On the numerical solution of heat conduction problems in two or three space variables. Transactions of the American Mathematical Society, 82, 421-439.
25. J.M. Dye and S. Reich (1992). Unrestricted iterations of nonexpansive mappings in Hilbert space. Nonlinear Analysis, Theory, Methods, and Applications, 18, 199-207.
26. J. Eckstein and D.P. Bertsekas (1992). On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 55, 293-318.
27. L.G. Gubin, B.T. Polyak and E.V. Raik (1967). The method of projections for finding the common point of convex sets. USSR Computational Mathematics and Mathematical Physics, 7, 1-24.
28. S. Kaczmarz (1937). Angenäherte Auflösung von Systemen linearer Gleichungen. Bulletin de l'Académie des Sciences de Pologne, A35, 355-357.
29. A. Kaplan and R. Tichatschke (2001). A general view on proximal point methods to variational inequalities in Hilbert spaces - iterative regularization and approximation. Journal of Nonlinear and Convex Analysis, 2, 305-332.
30. R.B. Kellogg (1969). A nonlinear alternating direction method. Mathematics of Computation, 23, 23-27.
31. K.C. Kiwiel and B. Lopuch (1997). Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM Journal on Optimization, 7, 1084-1102.
32. N. Lehdili and B. Lemaire (1999). The barycentric proximal method. Communications on Applied Nonlinear Analysis, 6, 29-47.
33. B. Lemaire (1989). The proximal algorithm. In: J.P. Penot, (Ed.), New Methods in Optimization and their Industrial Uses, International Series of Numerical Mathematics, Vol. 87, pp. 73-87. Birkhäuser, Boston, MA.
34. B. Lemaire (1996). Stability of the iteration method for nonexpansive mappings. Serdica Mathematical Journal, 22, 331-340.
35. B. Lemaire (1997), Which fixed point does the iteration method select? Lecture Notes in Economics and Mathematical Systems, Vol. 452, pp. 154-167. Springer-Verlag, New York.
36. J. Lieutaud (1969). Approximation d' Opérateurs par des Méthodes de Décomposition. Thèse, Université de Paris.
37. J.L. Lions (1969). Quelques Méthodes de Résolution des Problèmes aux Limites Non Linéaires. Dunod, Paris.
38. P.L. Lions and B. Mercier (1979). Splitting algorithms for the sum of two nonlinear operators. SIAM Journal on Numerical Analysis, 16, 964-979.
39. P. Mahey and D.T. Pham (1993). Partial regularization of the sum of two maximal monotone operators. RAIRO Modélisation Mathématique et Analyse Numérique, 27, 375-392.
40. B. Martinet (1972). Algorithmes pour la Résolution de Problèmes d'Optimisation et de Minimax. Thèse, Université de Grenoble, France.
41. B. Martinet (1972). Détermination approchée d'un point fixe d'une application pseudo-contractante. Cas de l'application prox. Comptes Rendus de l'Académie des Sciences de Paris, A274, 163-165.
42. B. Mercier (1979). Lectures on Topics in Finite Element Solution of Elliptic Problems. Lectures on Mathematics and Physics, Vol. 63. Tata Institute of Fundamental Research, Bombay.
43. B. Mercier (1980). Inéquations Variationnelles de la Mécanique, Publications Mathématiques d'Orsay, no. 80.01. Université Paris 11, Orsay, France.
44. G.J. Minty (1962). Monotone (nonlinear) operators in Hilbert space. Duke Mathematical Journal, 29, 341-346.
45. J.-J. Moreau (1965). Proximité et dualité dans un espace hilbertien. Bulletin de la Société Mathématique de France, 93, 273-299.
46. A. Moudafi (2000). On the regularization of the sum of two maximal monotone operators. Nonlinear Analysis, 42, 1203-1208.
47. D.W. Peaceman and H.H. Rachford (1955). The numerical solution of parabolic and elliptic differential equations. Journal of the Society for Industrial and Applied Mathematics, 3, 28-41.
48. T. Pennanen (2002). A splitting method for composite mappings. Numerical Functional Analysis and Optimization, 23, 875-890.
49. B.T. Polyak (1987). Introduction to Optimization. Optimization Software Inc., New York.
50. S. Reich (1983). A limit theorem for projections. Linear and Multilinear Algebra, 13, 281-290.
51. R.T. Rockafellar (1976). Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research, 1, 97-116.
52. R.T. Rockafellar (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14, 877-898.
53. J.E. Spingarn (1985). Applications of the method of partial inverses to convex programming: decomposition. Mathematical Programming, 32, 199-223.
54. P. Tossings (1994). The perturbed proximal point algorithm and some of its applications. Applied Mathematics and Optimization, 29, 125-159.
55. P. Tseng (1990). Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming. Mathematical Programming, 48, 249-263.
56. P. Tseng (1991). Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM Journal on Control and Optimization, 29, 119-138.
57. R.S. Varga (2000). Matrix Iterative Analysis, 2nd Edn. Springer-Verlag, New York.
58. N.N. Yanenko (1968). Méthode à Pas Fractionnaires. Armand Colin, Paris (see also The Method of Fractional Steps (1971). Springer-Verlag, New York).
59. N.N. Yanenko (1968). Méthode à Pas Fractionnaires. Armand Colin, Paris (see also The Method of Fractional Steps (1971). Springer-Verlag, New York).
60. E.H. Zarantonello (1971). Projections on convex sets in Hilbert space and spectral theory. In: E.H. Zarantonello (Ed.), Contributions to Nonlinear Functional Analysis, pp. 237-424. Academic Press, New York.
61. E. Zeidler (1990). Nonlinear Functional Analysis and Its Applications II/B - Nonlinear Monotone Operators. Springer-Verlag, New York.