Error bounds for proximal point subproblems and associated inexact proximal point algorithms

Mathematical Programming, Series B

Volumn 88, Issue 2, 2000, Pages 371-389

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

^a IMPA   (Brazil)

Author keywords

(Enlargement of) maximal monotone operator; Error bound; Proximal point subproblems; Regularized gap function; Variational inequalities

Indexed keywords

EID: 0001742121     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050022     Document Type: Article

References (41)

1. Auchmuty, G. (1989): Variational principles for variational inequalities. Numer. Funct. Anal. Optim. 10, 863-874
2. Auslender, A. (1987): Numerical methods for nondifferentiable convex optimization. Math. Program. Study 30, 102-126
3. Bonnans, J.F. (1994): Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Appl. Math. Optim. 29, 161-186
4. Burachik, R.S., Iusem, A.N., Svaiter, B.F. (1997): Enlargement of monotone operators with applications to Variational inequalities. Set-Valued Anal. 5, 159-180
5. Burachik, R.S., Sagastizábal, C.A., Svaiter, B.F. (1999): Bundle methods for maximal monotone operators. In: Tichatschke, R., Théra, M., eds., III-posed variational problems and regularization techniques. Lecture Notes in Economics and Mathematical Systems, No. 477, pp. 49-64, Springer
6. Burachik, R.S., Sagastizábal, C.A., Svaiter, B.F. (1999): ε-Enlargements of maximal monotone operators: Theory and applications. In: Fukushima, M., Qi, L., eds., Reformulation - Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 25-44, Kluwer Academic Publishers
7. Burachik, R.S., Svaiter, B.F. (1999): ε-Enlargements of maximal monotone operators in Banach spaces. Set-Valued Anal. 7, 117-132
8. Burke, J.V., Qian, M. (1998): A variable metric proximal point algorithm for monotone operators. SIAM J. Control Optim. 37, 353-375
9. Cominetti, R. (1997): Coupling the proximal point algorithm with approximation methods. J. Optim. Theory Appl. 95, 581-600
10. Crouzeix, J.-P. (1998): Characterizations of generalized convexity and generalized monotonicity, a survey. In: Crouzeix, J.-P. et al., eds., Generalized convexity, generalized monotonicity: Recent results, pp. 237-256, Kluwer Academic Publishers
11. Eckstein, J. (1998): Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113-123
12. 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
13. Fukushima, M. (1992): Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 53, 99-110
14. Fukushima, M. (1996): Merit functions for variational inequality and complementarity problems. In: Di Pillo, G., Giannessi, F., eds., Nonlinear Optimization and Applications, pp. 155-170, Plenum Publishing Corporation, New York, New York
15. Güler, O. (1992): New proximal point algorithms for convex minimization. SIAM J. Optim. 2, 649-664
16. Harker, P.T., Pang, J.-S. (1990): Finite-dimensional variational inequality problems : A survey of theory, algorithms and applications. Math. Program. 48, 161-220
17. Josephy, N.H. (1979): Newton's method for generalized equations. Technical Summary Report 1965, Mathematics Research Center, University of Wisconsin, Madison, Wisconsin
18. Karamardian, S., Schaible, S. (1990): Seven kinds of monotone maps. J. Optim. Theory Appl. 66, 37-47
19. 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
20. Luque, F.J. (1984): Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control Optim. 22, 277-293
21. Mangasarian, O.L., Solodov, M.V. (1993): Nonlinear complementarity as unconstrained and constrained minimization. Math. Program. 62, 277-297
22. Martinet, B. (1970): Regularisation d'inequations variationelles par approximations successives. Revue Française d'Informatique et de Recherche Operationelle 4, 154-159
23. Pang, J.-S. (1987): A posteriori error bounds for the linearly-constrained variational inequality problem. Math. Oper. Res. 12, 474-484
24. Pang, J.-S. (1997): Error bounds in mathematical programming. Math. Program. 79, 299-332
25. Reich, S. (1979): Weak convergence theorems for nonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 67, 274-276
26. Rockafellar, R.T. (1970): On the maximality of sums of nonlinear monotone operators. Trans. Am. Math. Soc. 149, 75-88
27. Rockafellar, R.T. (1976): Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97-116
28. Rockafellar, R.T. (1976): Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877-898
29. Sagastizábal, C. (1999): Variantes de métodos de haces para resolver problemas de talla grande. In: Montenegro, J. et al., eds., CEDYA 99, Actas, pp. 512-519, Universidad de Las Palmas
30. Sagastizábal, C. (2000): Bundle management: a hybrid method suitable after compression. Working paper
31. Solodov, M.V. (2000): Implicit Lagrangian. In: Floudas, C., Pardalos, P., eds., Encyclopedia of Optimization. Kluwer Academic Publishers
32. Solodov, M.V., Svaiter, B.F. (1999): A new projection method for variational inequality problems. SIAM J. Control Optim. 37, 765-776
33. Solodov, M.V., Svaiter, B.F. (2000): A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM J. Optim. 10, 605-625
34. Solodov, M. V., Svaiter, B.F. (2000): A comparison of rates of convergence of two inexact proximal point algorithms. In: Di Pillo, G., Giannessi, F., eds., Nonlinear Optimization and Related Topics, pp. 415-427. Kluwer Academic Publishers
35. 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
36. Solodov, M.V., Svaiter, B.F. (1999): A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7, 323-345
37. Solodov, M.V., Svaiter, B.F. (1999): A hybrid projection - proximal point algorithm. J. Convex Anal. 6, 59-70
38. Taji, K., Fukushima, M., Ibaraki, T. (1993): A globally convergent Newton method for solving strongly monotone variational inequalities. Math. Program. 58, 369-383
39. Tossings, P. (1994): The perturbed proximal point algorithm and some of its applications. Appl. Math. Optim. 29, 125-159
40. Tseng, P. (2000): A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38, 431-446
41. Tseng, P., Yamashita, N., Fukushima, M. (1996): Equivalence of complementarity problems to differentiable minimization : A unified approach. SIAM J. Optim. 6, 446-460