Skip to main content
Log in

Computing nonlinear network equilibria

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper examines the problem of computing nonlinear network equilibria using a ‘Newton’ iteration. By exploiting the network structure, we are able to show that the iteration is globally convergent, monotonic, and (locally) quadratically convergent using only simple algebraic arguments.

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. R. Asmuth, B.C. Eaves and E.L. Peterson, “Computing economic equilibria on affine networks with Lemke’s algorithm”,Mathematics of Operations Research 4 (1979) 209–214.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.E. Dennis and J.J. More, “Quasi-Newton methods, motivation and theory”,SIAM Review 19 (1977) 46–89.

    Article  MATH  MathSciNet  Google Scholar 

  3. B.C. Eaves, “A locally quadratically convergent algorithm for computing stationary points”, TR SOL 78-13, Department of Operations Research, Stanford University, May, 1978.

  4. S. Enke, “Equilibrium among spatially separated markets: Solution by electric analogue”,Econometrica 19 (1951) 40–47.

    Article  MATH  Google Scholar 

  5. S.C. Fang, “Generalized complementarity, variational inequality, and fixed point problems: Theory and applications”, Ph.D. Dissertation, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1979).

    Google Scholar 

  6. S.C. Fang, “An iterative method for generalized complementarity problems”, Mathematics Research Report No. 79-11, Department of Mathematics, University of Maryland (Cantonsville, MD, October, 1979).

    Google Scholar 

  7. D. Gale,The theory of linear economic models (McGraw-Hill, New York, 1960).

    Google Scholar 

  8. C.R. Glassey, “A quadratic network optimization model for equilibrium single commodity trade flows”,Mathematical Programming 14 (1978) 98–107.

    Article  MATH  MathSciNet  Google Scholar 

  9. N. Josephy, “Newton’s method for generalized equations”, TSR No. 1966, Mathematics Research Center, University of Wisconsin (Madison, WI, 1979).

    Google Scholar 

  10. L. Mathiesen, “A linear complementarity approach to general equilibrium”, Working Paper WP SOL 74-9, Department of Operations Research, Stanford University (Stanford, CA, 1974)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. J.S. Pang and P.S.C. Lee, “A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model”,Mathematical Programming 20 (1981) 81–102.

    Article  MATH  MathSciNet  Google Scholar 

  13. S.M. Robinson, “Generalized equations”, in: A. Bachem, M. Grotschel and B. Korte, eds.,Mathematical programming: The state of the art (Springer-Verlag, Berlin, 1983) pp. 346–367.

    Google Scholar 

  14. P. Samuelson, “Spatial price equilibrium and linear programming”,American Economic Review 42 (1952) 283–303.

    Google Scholar 

  15. T. Takayama and G.G. Judge,Spatial and temporal price and allocation models (North-Holland, Amsterdam, 1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jones, P.C., Saigal, R. & Schneider, M. Computing nonlinear network equilibria. Mathematical Programming 31, 57–66 (1985). https://doi.org/10.1007/BF02591861

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation