A New Hybrid Generalized Proximal Point Algorithm for Variational Inequality Problems

1. Auslender, A., Teboulle, M. and Ben-Tiba, S. (1999), A logarithmic-quadratic proximal method for variational inequalities, Computational Optimization and Applications 12, 31-40.

   Google Scholar 

2. Auslander, A., Teboulle, M. and Ben-Tiba, S. (1999), Interior proximal and multiplier methods based on second order homogeneous kernels, Mathematics of Operations Research 24, 645-668.

   Google Scholar 

3. Bauschke, H.H. and Borwein, J.M. (1997), Legendre functions and the method of random Bregman projections, Journal of Convex Analysis 4, 27-67.

   Google Scholar 

4. Bregman, L.M. (1967), The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming, USSR Computational Mathematics and Mathematical Physics 7, 200-217.

   Google Scholar 

5. Burachik, R.S. and Iusem, A.N. (1998), A generalized proximal point algorithm for the variational inequality problem in a Hilbert space, SIAM Journal on Optimization 8, 197-216.

   Google Scholar 

6. Burachik, R.S., Iusem, A.N. and Svaiter, B.F. (1997), Enlargement of monotone operators with applications to variational inequalities, Set-Valued Analysis 5, 159-180.

   Google Scholar 

7. Censor, Y. and Zenios, S.A. (1992), The proximal minimization algorithm with D-functions, Journal of Optimization Theory and Applications 73, 451-464.

   Google Scholar 

8. Censor, Y., Iusem, A.N. and Zenios, S.A. (1998), An interior point method with Bregman functions for variational inequality problem with paramonotone operators, Mathematical Programming 81, 373-400.

   Google Scholar 

9. Chen, G. and Teboulle, M. (1993), Convergence analysis of proximal-like optimization algorithm using Bregman functions, SIAM Journal on Optimization 3, 538-543.

   Google Scholar 

10. Eaves, B.C. (1978), Computing stationary points, Mathematical Programming Study 7, 1-14.

    Google Scholar 

11. Eckstein, J. (1993), Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Mathematics of Operations Research 18, 202-226.

    Google Scholar 

12. Eckstein, J. (1998), Approximate iterations in Bregman function-based proximal algorithms, Mathematical Programming 83, 113-123.

    Google Scholar 

13. Eckstein, J. and Ferris, M.C. (1999), Smooth methods of multipliers for complementarity problems, Mathematical Programming 86, 65-90.

    Google Scholar 

14. Harker, P.T. and Pang, J.S. (1990), A damped-Newton method for the linear complementarity problem, Lectures in Applied Mathematics 26, 265-284.

    Google Scholar 

15. He, B.S. and Yang, H. (2000), A neural-network model for monotone linear asymmetric variational inequalities, IEEE Transaction on Neural Networks 11, 3-16.

    Google Scholar 

16. Iusem, A.N. (1998), On some properties of generalized proximal point methods for the variational inequality problem, Journal of Optimization Theory and Applications 96, 337–362.

    Google Scholar 

17. Iusem, A.N. (1995), On some properties of generalized proximal point methods for quadratic and linear programming, Journal of Optimization Theory and Applications 85, 596-612.

    Google Scholar 

18. Kiwiel, K.C. (1997), Proximal minimization methods with generalized Bregman functions, SIAM Journal on Control and Optimization 35, 1142-1168.

    Google Scholar 

19. Marcotte, P. and Dussault, J.P. (1987), A note on a globally convergent Newton method for solving variational inequalities, Operations Research Letters 6, 35-42.

    Google Scholar 

20. Martinet, B. (1970), Regularization d'inequations variationelles par approximations successives, Revue Francaise d'Informatique et de Recherche Opérationelle 4, 154-159.

    Google Scholar 

21. Murty, K.G. (1988), Linear Complementarity, Linear and Nonlinear Programming, Helderman-Verlag, Berlin.

    Google Scholar 

22. Rockafellar, R.T. (1976), Monotone operators and the proximal point algorithm, SIAM Journal on Control and Optimization 14, 877-898.

    Google Scholar 

23. Solodov, M.V. and Svaiter, B.F. (2000), An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions, Mathematics of Operations Research 25, 214-230.

    Google Scholar 

24. Solodov, M.V. and Svaiter, B.F. (1999), A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator, Set Valued Analysis 7, 323-345.

    Google Scholar 

25. Taji, K., Fukushima, M. and Ibaraki, T. (1993), A globally convergent Newton method for solving strongly monotone variational inequalities, Mathematical Programming 58, 369–383.

    Google Scholar 

26. Teboulle, M. (1997), Convergence of proximal-like algorithms, SIAM Journal on Optimization 7, 1069-1083.

    Google Scholar 

Download references