Advertisement

Mathematical Programming

, Volume 16, Issue 1, pp 210–227 | Cite as

Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm

  • Hoàng Tuy
Article

Abstract

On the basis of a unified approach to pivotal algorithms and a generalization of the concept of primitive sets by Scarf we show that Scarf's algorithm for finding fixed points can be embedded into a class of more flexible and more efficient algorithms, allowing restarts. An example of this new restart method is described. Also the class of equilibrium problems solvable by this method is discussed.

Key words

Pivotal Algorithms Equilibrium Point Primitive Sets Restart Method 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K.J. Arrow and F.H. Hahn,General competitive analysis (Oliver and Boyd, Edinburg, 1971).Google Scholar
  2. [2]
    B.C. Eaves, “Homotopies for computation of fixed points”,Mathematical Programming 3 (1972) 1–22.Google Scholar
  3. [3]
    B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points on unbounded regions”,Mathematical Programming 3 (1972) 225–237.Google Scholar
  4. [4]
    B.C. Eaves, “Properly labelled simplices”, in: G.B. Dantzig and B.C. Eaves, eds.,Studies in optimization 10, MAA Studies in Mathematics (1974) pp. 71–93.Google Scholar
  5. [5]
    B.C. Eaves, “A short course in solving equations with PL homotopies”,SIAM-AMS Proceedings 9 (1976) 73–143.Google Scholar
  6. [6]
    B.C. Eaves and H.E. Scarf, “The solutions of systems of piecewise linear equations”,Mathematics of Operations Research 1 (1976) 1–27.Google Scholar
  7. [7]
    F.J. Gould and J.W. Tolle, “A unified approach to complementarity in optimization”,Discrete Mathematics 7 (1974) 225–272.Google Scholar
  8. [8]
    Hoang Tuy, Nguyen van Thoai and Le dung Muu, “Un nouvel algorithme de point fixe”,Comptes Rendus de l'Académie des Sciences de Paris 286 (1978) SérieA 783–785.Google Scholar
  9. [9]
    H.W. Kuhn, “Simplicial approximation of fixed points”,Proceedings of the National Academy of Sciences, USA 61 (1968) 1238–1242.Google Scholar
  10. [10]
    H.W. Kuhn and J.G. MacKinnon, “Sandwich method for finding fixed points”,Journal of Optimization Theory and Applications 17 (1975) 189–204.Google Scholar
  11. [11]
    C.M. Lemke and J.T. Howson, “Equilibrium points of bimatrix games”,SIAM Journal on Applied Mathematics 12 (1964) 413–423.Google Scholar
  12. [12]
    O.H. Merrill, “Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings”, Thesis, University of Michigan (1972).Google Scholar
  13. [13]
    H.E. Scarf, “The approximation of fixed points of a continuous mapping”,SIAM Journal on Applied Mathematics 15 (1967) 1323–1343.Google Scholar
  14. [14]
    H.E. Scarf, with the collaboration of T. Hansen,The computation of economic equilibria (Yale University Press, New Haven, 1973).Google Scholar
  15. [15]
    M.J. Todd, “A generalized complementary pivoting algorithm”,Mathematical Programming 6 (1974) 243–263.Google Scholar

Copyright information

© The Mathematical Programming Society 1979

Authors and Affiliations

  • Hoàng Tuy
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations