Forcing strong convergence of proximal point iterations in a Hilbert space

Mathematical Programming, Series B

Volumn 87, Issue 1, 2000, Pages 189-202

  Solodov, M V ^a   Svaiter, B F ^a  

^a IMPA   (Brazil)

Author keywords

Hilbert spaces; Proximal point algorithm; Strong convergence; Weak convergence

Indexed keywords

EID: 0001279962     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101079900113     Document Type: Article

References (32)

1. Allgower, E.L., Böhmer, K. (1987): Application of the mesh-independence principle to mesh refinement strategies. SIAM J. Numer. Anal. 24, 1335-1351
2. Allgower, E.L., Böhmer, K., Potra, F.-A., Rheinboldt, W.C. (1986): A mesh-independence principle for operator equations and their discretizations. SIAM J. Numer. Anal. 23, 160-169
3. Bauschke, H.H., Combettes, P.L. (1999): A weak-to-strong convergence principle for Fejér-monotone methods in Hilbert spaces. Math. Oper. Res. submitted 1999
4. Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., Sagastizábal, C. (1995): A family of variable metric proximal point methods. Math. Program. 68, 15-47
5. Brézis, H., Lions, P.L. (1978): Produits infinis de résolvantes. Isr. J. Math. 29, 329-345
6. Burke, J.V., Qian, M. (1998): A variable metric proximal point algorithm for monotone operators. SIAM J. Control Optim. 37, 353-375
7. Combettes, P.L. (1999): Strong convergence of block-iterative outer approximation methods for convex optimization. SIAM J. Control Optim. To appear
8. Eckstein, J. (1998): Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113-123
9. Eckstein, J., Bertsekas, D.P. (1992): On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293-318
10. Ferris, M.C. (1991): Finite termination of the proximal point algorithm. Math. Program. 50, 359-366
11. Gülcr, O. (1991): On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403-419
12. Güler, O. (1992): New proximal point algorithms for convex minimization. SIAM J. Optim. 2, 649-664
13. Henry, J., Yvon, J-P., eds. (1994): Lecture notes in Control and Information Sciences No. 197, System Modelling and Optimization. Springer, Berlin
14. Kinderlehrer, D., Stampacchia, G. (1980): An introduction to variational inequalities and their applications. Academic Press, New York
15. Laumen, M. (1999): Newton's mesh independence principle for a class of optimal shape design problems. SIAM J. Control Optim. 37, 1070-1088
16. Lemaire, B. (1989): The proximal algorithm. In: Penot, J.P., ed., New Methods of Optimization and Their Industrial Use. International Series of Numerical Mathematics 87, pp. 73-87. Birkhauser, Basel
17. Luque, F.J. (1984): Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control Optim. 22, 277-293
18. Martinet, B. (1970): Regularisation d'inequations variationelles par approximations successives. Revue Française d'Informatique et de Recherche Opérationelle 4, 154-159
19. Minty, G.J. (1962): Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29, 341-346
20. Moreau, J.-J. (1965): Proximité' et dualité dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273-299
21. Passty, G.B. (1979): Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 67, 274-276
22. Rockafellar, R.T. (1970): On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 149, 75-88
23. Rockafellar, R.T. (1976): Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97-116
24. Rockafellar, R.T. (1976): Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877-898
25. Solodov, M.V., Svaiter, B.F.: A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM J. Optim. To appear
26. Solodov, M.V., Svaiter, B.F. (1999): A new projection method for variational inequality problems. SIAM J. Control Optim. 37, 765-776
27. Solodov, M.V., Svaiter, B.F. (1999): A comparison of rates of convergence of two inexact proximal point algorithms. In: Di Pillo, G., Giannessi, F., eds., Nonlinear Optimization and Related Topics. Kluwer Academic Publishers. To appear
28. Solodov, M.V., Svaiter, B.F. (1998): A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Analysis. To appear
29. Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. To appear
30. Solodov, M.V., Svaiter, B.F. (1999): A globally convergent inexact Newton method for systems of monotone equations. In: Fukushima, M., Qi, L., eds., Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 355-369. Kluwer Academic Publishers
31. Solodov, M.V., Svaiter, B.F. (1999): A hybrid projection - proximal point algorithm. J. Convex Anal. 6, 59-70
32. Zarantonello, E.H. (1971): Projections on convex sets in Hilbert space and spectral theory. In: Zarantonello, E.H., ed., Contributions to Nonlinear Functional Analysis, pp. 237-424. Academic Press, New York