Skip to main content
Log in

A globally convergent Newton method for solving strongly monotone variational inequalities

  • Published:
Mathematical Programming Submit manuscript

Abstract

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Auslander,Optimisation: Méthodes Numériques (Masson, Paris, 1976).

    Google Scholar 

  2. D.P. Bertsekas and E.M. Gafni, “Projection methods for variational inequalities with application to the traffic assignment problem,”Mathematical Programming Study 17 (1982) 139–159.

    Google Scholar 

  3. D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  4. S. Dafermos, “Traffic equilibrium and variational inequalities,”Transportation Science 14 (1980) 42–54.

    Google Scholar 

  5. S. Dafermos, “An iterative scheme for variational inequalities,”Mathematical Programming 26 (1983) 40–47.

    Google Scholar 

  6. B.C. Eaves, “Computing stationary points,”Mathematical Programming Study 7 (1978) 1–14.

    Google Scholar 

  7. M. Florian, “Mathematical programming applications in national, regional and urban planning,” in: M. Iri and K. Tanabe, eds.,Mathematical Programming: Recent Developments and Applications (KTK Scientific Publishers, Tokyo, 1989) pp. 283–307.

    Google Scholar 

  8. M. Florian and H. Spiess, “The convergence of diagonalization algorithms for asymmetric network equilibrium problems,”Transportation Research 16B (1982) 447–483.

    Google Scholar 

  9. M. Fukushima, “A relaxed projection method for variational inequalities,”Mathematical Programming 35 (1986) 58–70.

    Google Scholar 

  10. M. Fukushima, “Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems,”Mathematical Programming 53 (1992) 99–110.

    Google Scholar 

  11. J.H. Hammond and T.L. Magnanti, “Generalized descent methods for asymmetric systems of equations,”Mathematics of Operations Research 12 (1987) 678–699.

    Google Scholar 

  12. P.T. Harker and J.S. Pang, “Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications,”Mathematical Programming 48 (1990) 161–220.

    Google Scholar 

  13. D.W. Hearn, “The gap function of a convex program,”Operations Research Letters 1 (1982) 67–71.

    Google Scholar 

  14. T. Ito, M. Fukushima and T. Ibaraki, “An iterative method for variational inequalities with application to traffic equilibrium problems,”Journal of Operations Research Society of Japan 31 (1988) 82–104.

    Google Scholar 

  15. N.H. Josephy, “Newton's method for generalized equations,” Technical Report No. 1965, Mathematics Research Center, University of Wisconsin (Madison, WI, 1979).

    Google Scholar 

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

    Google Scholar 

  17. P. Marcotte and J.P. Dussault, “A sequential linear programming algorithm for solving monotone variational inequalities,”SIAM Journal on Control and Optimization 27 (1989) 1260–1278.

    Google Scholar 

  18. A. Nagurney and J. Aronson, “A general dynamic spatial price network equilibrium model with gains and losses,”Networks 19 (1989) 751–769.

    Google Scholar 

  19. J.M. Ortega and W.C. Rheinbolt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).

    Google Scholar 

  20. J.S. Pang, “Asymmetric variational inequality problems over product sets: Applications and iterative methods,”Mathematical Programming 31 (1985) 206–219.

    Google Scholar 

  21. J.S. Pang and D. Chan, “Iterative methods for variational and complementarity problems,”Mathematical Programming 24 (1982) 284–313.

    Google Scholar 

  22. G. Auchmuty, “Variational principles for variational inequalities,”Numerical Functional Analysis and Optimization 10 (1989) 863–879.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Masao Fukushima.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taji, K., Fukushima, M. & Ibaraki, T. A globally convergent Newton method for solving strongly monotone variational inequalities. Mathematical Programming 58, 369–383 (1993). https://doi.org/10.1007/BF01581276

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581276

Key words

Navigation