Skip to main content
Log in

Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper presents an acceleration step for the linearly convergent diagonalization and projection algorithms for finite-dimensional variational inequalities which is reminiscent of a PARTAN step in nonlinear programming. After establishing the convergence of this technique for both algorithms, several numerical examples are presented to illustrate the sometimes dramatic savings in computation time which this simple acceleration step yields.

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. B.H. Ahn,Computation of Market Equilibria for Policy Analysis: The Project Independence Evaluation Study (PIES) (Garland, New York, NY, 1979).

    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 16 (1982) 139–159.

    Google Scholar 

  3. J. Bisschop and A. Meeraus, “On the development of general algebraic modeling systems in a strategic planning environment,”Mathematical Programming Study 20 (1982) 1–29.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. T.L. Friesz, R.L. Tobin and P.T. Harker, “Variational inequalities and convergence of diagonalization methods for derived demand network equilibrium problems,” Working Paper CUE-FNEM-1981–10-1, Department of Civil Engineering, University of Pennsylvania, 1981.

  7. T.L. Friesz, R.L. Tobin, T.E. Smith and P.T. Harker, “A nonlinear complementarity formulation and solution procedure for the general derived demand network equilibrium problem,”Journal of Regional Science 23 (1983) 337–359.

    Google Scholar 

  8. D. Gabay and H. Moulin, “On the uniqueness and stability of Nash-equilibria in noncooperative games,” in: A. Bensoussan, P. Kleindorfer and C.S. Taperio, eds.,Applied Stochastic Control in Econometrics and Management Science (North-Holland, Amsterdam, 1980).

    Google Scholar 

  9. R. Glowinski, J.L. Lions and R. Tremolieres,Analyse Numerique des Inequations Variationelles, Methodes Mathematiques de l'Informatique (Bordas, Paris, 1976).

    Google Scholar 

  10. J.H. Hammond, “Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming,” Ph.D. dissertation, Department of Mathematics, MIT, Cambridge, MA, 1984.

    Google Scholar 

  11. J.H. Hammond and T.L. Magnanti, “Generalized descent methods for asymmetric systems of equations and variational inequalities,” Working Paper OR 137-85, Operations Research Center, M.I.T., Cambridge, MA, 1985.

    Google Scholar 

  12. P.T. Harker, “A variational inequality approach for the determination of oligopolistic market equilibrium,”Mathematical Programming 30 (1984) 105–111.

    Google Scholar 

  13. P.T. Harker, “Alternative models of spatial competition,”Operations Research 34 (1986) 410–425.

    Google Scholar 

  14. P.T. Harker and T.L. Friesz, “Prediction of intercity freight flows, I: theory and II: mathematical formulations,”Transportation Research 20B (1986) 139–153 and 155–174.

    Google Scholar 

  15. F.H. Murphy, H.D. Sherali and A.L. Soyster, “A mathematical programming approach for determining oligopolistic market equilibrium,”Mathematical Programming 24 (1982) 92–106.

    Google Scholar 

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

    Google Scholar 

  17. J.-S. Pang, “Solution of the general multicommodity spatial equilibrium problem by variational and complementarity problems,”Journal of Regional Science 24 (1984) 403–414.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Harker, P.T. Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Mathematical Programming 41, 29–59 (1988). https://doi.org/10.1007/BF01580752

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation