Convergence analysis of non-quadratic proximal methods for variational inequalities in hilbert spaces

Journal of Global Optimization

Volumn 22, Issue 1-4, 2002, Pages 119-136

  Kaplan, Alexander ^a   Tichatschke, Rainer ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

Monotone operators; Proximal point methods; Regularization; Variational inequalities

Indexed keywords

HILBERT SPACES; VECTOR SPACES;

GEOMETRICAL PROPERTY; MAXIMAL MONOTONE OPERATORS; MONOTONE OPERATORS; PROXIMAL POINT METHOD; PROXIMAL-LIKE METHODS; REGULARIZATION; SUCCESSIVE APPROXIMATIONS; VARIATIONAL INEQUALITIES;

VARIATIONAL TECHNIQUES;

EID: 31244433954     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/a:1013846811189     Document Type: Article

References (29)

1. Alber, Y., R. Burachik, and A. Iusem (1997), A proximal method for non-smooth convex optimization problems in Banach spaces. Abstr. Appl. Anal.2 (1-2), 97–120
2. Auslender, A. and M. Haddou (1995), An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. Math. Programming71, 77–100
3. Auslender, A., M. Teboulle, and S. Ben-Tiba (1999), Interior proximal and multiplier methods based on second order homogeneous kernels. Mathematics of Oper. Res.24, 645–668
4. Ben-Tal, A. and M. Zibulevski (1997), Penalty-barrier methods for convex programming problems. SIAM J. Optim.7, 347–366
5. Bruck, R. E. (1975), An iterative solution of a variational inequality for certain monotone operators in Hilbert space. Bulletin of the American Mathem. Society81, 890–892
6. Burachik, R. and A. Iusem (1998), A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J. Optim.8, 197–216
7. Butnariu, D. and A. Iusem (1997), On a proximal point method for convex optimization in Banach spaces. Numer. Funct. Anal. and Optimiz.18(7-8), 723–744
8. Butnariu, D. and A. Iusem (2000), Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Kluwer, Dordrecht-Boston-London
9. Censor, Y., A. Iusem, and S. A. Zenios (1998), An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Math. Programming81, 373–400
10. Crouzeix, J.-P. (1997), Pseudo-monotone variational inequality problems: Existence of solutions. Math. Programming78, 305–314
11. Eckstein, J. (1993), Nonlinear proximal point algorithms using Bregman functions, with application to convex programming. Math. Oper. Res.18, 202–226
12. Eckstein, J. (1998), Approximate iterations in Bregman-function-based proximal algorithms. Math. Programming83, 113–123
13. Glowinski, R., J. L. Lions, and R. Trémolières (1981), Numerical Analysis of Variational Inequalities. North-Holland, Amsterdam
14. Iusem, A. (1995), On some properties of generalized proximal point methods for quadratic and linear programming. JOTA85, 593–612
15. Kaplan, A. and R. Tichatschke, A general view on proximal point methods to variational inequalities in Hilbert spaces - iterative regularization and approximation. J. of Nonlinear and Convex Analysis (to appear)
16. Kaplan, A. and R. Tichatschke (2000), Auxiliary problem principle and the approximation of variational inequalities with non-symmetric multi-valued operators. CMS Conference Proc. 27, 185-209
17. Kaplan, A. and R. Tichatschke (1994), Stable Methods for Ill-Posed Variational Problems - Prox-Regularization of Elliptic Variational Inequalities and Semi-Infinite Optimization Problems. Akademie Verlag Berlin
18. Kaplan, A. and R. Tichatschke (1997), Prox-regularization and solution of ill-posed elliptic variational inequalities. Applications of Mathematics42, 111–145
19. Kaplan, A. and R. Tichatschke (2000), Proximal point approach and approximation of variational inequalities. SIAM J. Control Optim.39, 1136–1159
20. Kiwiel, K. (1999), A projection-proximal bundle method for convex nondifferentiable minimization. In: M. Thera and R. Tichatschke (eds.): Ill-posed Variational Problems and Regularization Techniques. pp. 137–150
21. Lions, J. L. (1969), QuelquesMéthodes de Résolution des Problèmes aux Limites non Linéaires. Dunod, Gauthier-Villars, Paris
22. Martinet, B. (1970), Régularisation d’inéquations variationelles par approximations successives. RIRO4, 154–159
23. Polyak, B. T. (1987), Introduction to Optimization. Optimization Software, Inc. Publ. Division, New York
24. Polyak, R. and M. Teboulle (1997), Nonlinear rescaling and proximal-like methods in convex optimization. Math. Programming76, 265–284
25. Renaud, A. and G. Cohen (1997), An extension of the auxiliary problem principle to nonsymmetric auxiliary operators. ESAIM: Control, Optimization and Calculus of Variations2, 281–306
26. Rockafellar, R. T. (1970), On the maximality of sums of nonlinear monotone operators. Trans. Amer. Math. Soc.149, 75–88
27. Rockafellar, R. T. (1976), Monotone operators and the proximal point algorithm. SIAM J. Control Optim.14, 877–898
28. Teboule, M. (1992), Entropic proximal mappings with application to nonlinear programming. Mathematics of Oper. Res.17, 670–690
29. Tseng, P. and D. Bertsekas (1993), On the convergence of the exponential multiplier method for convex programming. Math. Programming60, 1–19.