On some properties of generalized proximal point methods for variational inequalities

Journal of Optimization Theory and Applications

Volumn 96, Issue 2, 1998, Pages 337-362

  Iusem, A N ^a  

^a IMPA   (Brazil)

Author keywords

generalized distances; interior point methods; linear complementarity problems; nonlinear complementarity problems; Proximal point methods; variational inequalities

Indexed keywords

GEOMETRY; MATHEMATICAL OPERATORS; NONLINEAR PROGRAMMING; VARIATIONAL TECHNIQUES;

BREGMAN DISTANCES; FEASIBLE REGIONS; GENERALIZED DISTANCES; INTERIOR-POINT METHOD; LINEAR COMPLEMENTARITY PROBLEMS; NONLINEAR COMPLEMENTARITY PROBLEM; PROPERTY; PROXIMAL POINT METHOD; SYMMETRICS; VARIATIONAL INEQUALITIES;

JACOBIAN MATRICES;

EID: 0032364974     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022670114963     Document Type: Article

References (17)

1. KINDERLEHRER, D., and STAMPACCHIA, G., An Introduction to Variational Inequalities and Their Applications, Academic Press, New York, New York, 1980.
2. BURACHIK, R., and IUSEM, A. N., A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space, SIAM Journal on Optimization (to appear).
3. ROCKAFELLAR, R. T., Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, Vol. 14, pp. 877-898, 1976.
4. IUSEM, A. N., On Some Properties of Generalized Proximal Point Methods for Quadratic and Linear Programming, Journal of Optimization Theory and Applications, Vol. 85, pp. 593-612, 1995.
5. BREGMAN, L., The Relaxation Method for Finding the Common Point of Convex Sets and Its Application to the Solution of Problems in Convex Programming, USSR Computational Mathematics and Mathematical Physics, Vol. 7, pp. 200-217, 1967.
6. DE PIERRO, A., and IUSEM, A., A Relaxed Version of Bregman's Method for Convex Programming, Journal of Optimization Theory and Applications, Vol. 51, pp. 421-440, 1986.
7. LIESE, F., and VAJDA, I., Convex Statistical Distances, Teubner, Leipzig, Germany, 1987.
8. CENSOR, Y., IUSEM, A. N., and ZENIOS, S. A., An Interior-Point Method with Bregman Functions for the Variational Inequality Problem with Paramonotone Operators, Report 94-03, Department of Public and Business Administration, University of Cyprus, Nicosia, Cyprus, 1994.
9. IUSEM, A. N., On Some Properties of Paramonotone Operators, Technical Report B-101, Institute de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil, 1996.
10. CENSOR, Y., and ZENIOS, S., The Proximal Minimization Algorithm with D-Functions, Journal of Optimization Theory and Applications, Vol. 73, pp. 451-464, 1992.
11. CHEN, G., and TEBOULLE, M., Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions, SIAM Journal on Optimization, Vol. 3, pp. 538-543, 1993.
12. ECKSTEIN, J., Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming, Mathematics of Operations Research, Vol. 18, pp. 202-226, 1993.
13. BURACHIK, R., Generalized Proximal Point Methods for the Variational Inequality Problem, PhD Thesis, Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil, 1995.
14. NESTEROV, Y., and NEMIROVSKII, A., Interior-Point Polynomial Algorithms in Convex Programming, SIAM Publications, Philadelphia, Pennsylvania, 1994.
15. HOFFMAN, A. J., On Approximate Solutions of Systems of Linear Inequalities, Journal of Research of the National Bureau of Standards, Vol. 49, pp. 263-265, 1952.
16. IUSEM, A. N., SVAITER, B. F., and TEBOULLE, M., Entropy-Like Proximal Methods in Convex Programming, Mathematics of Operations Research, Vol. 19, pp. 790-814, 1994.
17. IUSEM, A. N., and TEBOULLE, M., Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming, Mathematics of Operations Research, Vol. 20, pp. 657-677, 1995.