Skip to main content
SpringerLink
Log in
Book cover

Topics in Numerical Analysis pp 149–202Cite as

An introduction to piecewise-linear homotopy algorithms for solving systems of equations

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 965))

Abstract

We describe a class of algorithms known as piecewise-linear homotopy methods for solving certain (generalized) zero-finding problems. The global and local convergence properties of these algorithms are discussed. We also outline recent techniques that have been proposed to improve the efficiency of the methods.

Research partially supported by the National Science Foundation under grant ECS-7921279 and by a fellowship from the Alfred P. Sloan Foundation.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C. Alexander and J.A. Yorke, "The homotopy continuation method: Numerically implementable topological procedures," Trans. Amer. Math. Soc. 242, 271–284 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Allgower and K. Georg, "Simplicial and continuation methods for approximating fixed points and solutions to systems of equations," SIAM Rev. 22, 28–85 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  3. S.A. Awoniyi and M.J. Todd, "An efficient simplicial algorithm for computing a zero of a convex union of smooth functions," School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1981).

    Google Scholar 

  4. I. Barany, "Borsuk's theorem through complementary pivoting," Math. Program. 18, 84–88 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  5. I. Barany, "Subdivisions and triangulations in fixed point algorithms," preprint, International Research Institute for Management Science, Moscow (1979).

    Google Scholar 

  6. F.J. Branin, Jr., "Widely convergent method for finding multiple solutions of simultaneous nonlinear equations," IBM J. Res. Develop. 16, 504–522 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  7. A. Charnes, C.B. Garcia and C.E. Lemke, "Constructive proofs of theorems relating to F(x)=y, with applications," Math. Program. 12, 328–343 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  8. S.N. Chow, J. Mallet-Paret and J.A. Yorke, "Finding zeros of maps: Homotopy methods that are constructive with probability one," Math. Comput. 32, 887–899 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  9. D.I.A. Cohen, "On the Sperner lemma," J. Comb. Theory 2, 585–587 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  10. G.B. Dantzig, Linear programming and extensions, Princeton University Press, Princeton, NJ (1963).

    Book  MATH  Google Scholar 

  11. F.-J. Drexler, "A homotopy method for the calculation of all zeros of zero-dimensional polynomial ideals," in Continuation methods, H. Wacker, ed. 69–94, Academic Press, New York (1978).

    Google Scholar 

  12. B.C. Eaves, "Computing Kakutani fixed points," SIAM J. Appl. Math. 21, 2, 236–244 (1971).

    Article  MathSciNet  MATH  Google Scholar 

  13. _____, "Homotopies for computation of fixed points," Math. Program. 3, 1–22 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  14. _____, "A short course in solving equations with PL homotopies," SIAM-AMS Proc. 9, 73–143 (1976).

    MathSciNet  MATH  Google Scholar 

  15. B.C. Eaves and R. Saigal, "Homotopies for computation of fixed points on unbounded regions," Math. Program. 3, 225–237 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  16. B.C. Eaves and H. Scarf, "The solution of systems of piecewise linear equations," Math. Oper. Res. 1, 1–27 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  17. M.L. Fisher and F.J. Gould, "A simplicial algorithm for the nonlinear complementarity problem," Math. Program. 6, 281–300 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  18. M.L. Fisher, F.J. Gould and J.W. Tolle, "A new simplicial approximation algorithm with restarts: relations between convergence and labelling," in Fixed points: algorithms and applications, S. Karamardian, ed., Academic Press, New York (1977).

    Google Scholar 

  19. W. Forster (ed.), Numerical solutions of highly nonlinear problems, North-Holland, Amsterdam (1980).

    Google Scholar 

  20. J. Freidenfelds, "Fixed-point algorithms and almost-complementary sets," TR71-17, Operations Research House, Stanford University, Stanford, California (1971).

    Google Scholar 

  21. R.M. Freund, "Variable-dimension complexes with applications," TR SOL 80-11, Department of Operations Research, Stanford University, Stanford, California (1980).

    Google Scholar 

  22. R.M. Freund and M.J. Todd, "A constructive proof of Tucker's combinatorial lemma," J. Comb. Theory (Series A) 30, 321–325 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  23. C.B. Garcia, "A global existence theorem for the equation Fx=y," Center for Mathematical Studies in Business and Economics Report 7527, University of Chicago, Chicago, Illinois (1975).

    Google Scholar 

  24. _____, "A fixed point theorem including the last theorem of Poincare," Math. Program. 9, 227–239 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  25. C.B. Garcia and F.J. Gould, "Relations between several path following algorithms and local and global Newton methods," SIAM Rev. 22, 263–274 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  26. C.B. Garcia and W.I. Zangwill, "Determining all solutions to certain systems of nonlinear equations," Math. Oper. Res. 4, 1–14 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  27. _____, "Finding all solutions to polynomial systems and other systems of equations," Math. Program. 16, 159–176 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  28. W. Gochet, E. Loute and D. Solow, "Comparative computer results of three algorithms for solving prototype geometric programming problems," Cahiers du Centre d'Etudes de Recherche Operationelle 16, 469–486 (1974).

    MathSciNet  MATH  Google Scholar 

  29. S.M. Goldfeld, R.E. Quand and H.F. Trotter, "Maximization by quadratic hill-climbing," Econometrica 34, 541–551 (1966).

    Article  MathSciNet  MATH  Google Scholar 

  30. F.J. Gould and J.W. Tolle, "An existence theorem for solutions to f(x)=0," Math. Program. 11, 252–262 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  31. S. Karamardian (ed.), Fixed points: algorithms and applications, Proc. Conf. on Computing Fixed Points with Applications, Clemson University, Academic Press, New York (1977).

    Google Scholar 

  32. J. Katzenelson, "An algorithm for solving nonlinear resistive networks," Bell System Technical Journal, 44, 1605–1620 (1965).

    Article  MATH  Google Scholar 

  33. H.B. Keller, "Global homotopies and Newton methods," in Recent Advances in Numerical Analysis, C. de Boor and G.H. Golub, eds., Academic Press, New York (1978).

    Google Scholar 

  34. R.B. Kellogg, T.Y. Li and J. Yorke, "A constructive proof of the Brouwer fixed point theorem and computational results," SIAM J. Numer. Anal. 4, 473–483 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  35. M. Kojima, "Computational methods for solving the nonlinear complementarity problem," Keio Engineering Reports 27, 1–41 (1974).

    MathSciNet  MATH  Google Scholar 

  36. _____ "On the homotopic approach to systems of equations with separable mappings," Math. Program. Study 7, M.L. Balinski and R.W. Cottle, eds., North Holland, Amsterdam, 170–184 (1978).

    Google Scholar 

  37. _____, "An introduction to variable dimension algorithms for solving systems of equations," in Numerical Solution of Nonlinear Equations, E.L. Allgower, K. Glashoff and H.-O. Peitgen, eds., Springer-Verlag, Berlin (1981).

    Google Scholar 

  38. M. Kojima, H. Nishino and N. Arima, "A PL homotopy for finding all the roots of a polynomial," Math. Program. 16, 37–62 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  39. M. Kojima, and Y. Yamamoto, "Variable dimension algorithms, part I: basic theory," Research Report B-77, Department of Information Sciences, Tokyo Institute of Technology, Tokyo (1979).

    Google Scholar 

  40. _____ "Variable dimension algorithms, part II: some new algorithms and triangulations with continuous refinement of mesh size," Research Report B-82, Department of Information Sciences, Tokyo Institute of Technology, Tokyo (1980).

    Google Scholar 

  41. H.W. Kuhn, "Simplicial approximation of fixed points," Proc. Nat. Acad. Sci., U.S.A., 61, 1238–1242 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  42. _____, "Approximate search for fixed points," Computing Methods in Optimization Problems 2, Academic Press, New York (1969).

    Google Scholar 

  43. _____ "Finding roots by pivoting," Fixed Points: Algorithms and Applications, S. Karamardian, ed., Academic Press, New York, 11–39 (1977).

    Chapter  Google Scholar 

  44. H. Kuhn and J.G. Mackinnon, "Sandwich method for finding fixed points," J. Optimization Theory Appl. 17, 189–204 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  45. G. van der Laan and A.J.J. Talman, "A restart algorithm for computing fixed points without an extra dimension," Math. Program. 17, 74–84 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  46. _____ "A restart algorithm without an artificial level for computing fixed points on unbounded regions," in Functional Differential Equations and Approximation of Fixed Points, H.-O. Peitgen and H.-O. Walther, eds., Lect. Notes Math. 730, Springer-Verlag, Berlin (1979).

    Google Scholar 

  47. _____ "Interpretation of the variable dimension fixed point algorithm with an artificial level," Faculty of Econometrics, Free University, Amsterdam (1979).

    MATH  Google Scholar 

  48. _____ "An improvement of fixed point algorithms by using a good triangulation," Math. Program. 18, 274–285 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  49. _____ "A new subdivision for computing fixed points with a homotopy algorithm," Math. Program. 19, 78–91 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  50. _____ "Convergence and properties of recent variable dimension algorithms," in Numerical Solution of Highly Nonlinear Problems, W. Forster, ed., North-Holland, Amsterdam (1980).

    Google Scholar 

  51. _____ "A class of simplicial restart fixed point algorithms without an extra dimension," Math. Program. 20, 33–48 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  52. C.E. Lemke, "A survey of complementarity theory," in Variational Inequalities and Complementarity Problems, R.W. Cottle, F. Gianessi and J.-L. Lions, eds., John Wiley, Chichester (1980).

    Google Scholar 

  53. C.E. Lemke and J.T. Howson, Jr., "Equilibrium points of bimatrix games," SIAM J. Appl. Math. 12, 413–423 (1964).

    Article  MathSciNet  MATH  Google Scholar 

  54. H.J. Luthi, Komplementaritats-und Fixpunktalgorithmen in der mathematischen Programmierung, Spieltheorie und Okonomie, Lect. Notes Econ. Math. Syst. 129, Springer-Verlag, Berlin (1976).

    Book  MATH  Google Scholar 

  55. O.H. Merrill, "Applications and extensions of an algorithm that computes fixed points of a certain upper semi-continuous point to set mappings," Ph.D. Thesis, Dept. of Industrial Engineering, University of Michigan (1972).

    Google Scholar 

  56. M.D. Meyerson and A.H. Wright, "A new and constructive proof of the Borsuk-Ulam theorem," Proc. Amer. Math. Soc. 73, 134–136 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  57. A.N. Netravali and R. Saigal, "Optimum quantizer design using a fixed-point algorithm," The Bell System Technical Journal 55, 1423–1435 (1976).

    Article  MathSciNet  Google Scholar 

  58. J.M. Ortega and W.C. Rheinboldt, Iterative solutions of nonlinear equations in several variables, Academic Press, New York-London (1970).

    MATH  Google Scholar 

  59. H.-O. Peitgen and H.-O. Walther, eds., Functional differential equations and approximation of fixed points, Lect. Notes Math. 730, Springer-Verlag, Berlin (1979).

    Google Scholar 

  60. P.M. Reiser, "A modified integer labeling for complementarity algorithms," Math. Oper. Res. 6, 129–139 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  61. S.M. Robinson, ed., Analysis and computation of fixed points, Academic Press, New York (1980).

    Google Scholar 

  62. R. Saigal, "On paths generated by fixed point algorithms," Math. Oper. Res. 1, 359–380 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  63. _____, "Fixed point computing methods," Encyclopedia of Computer Science and Technology, 8, Marcel Dekker Inc., New York (1977).

    Google Scholar 

  64. _____ "On the convergence rate of algorithms for solving equations that are based on complementary pivoting," Math. Oper. Res. 2, 108–124 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  65. _____, "The fixed point approach to nonlinear programming," Math. Program. Stud. 10, 142–157 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  66. _____ "Efficient algorithms for computing fixed points when mappings may be separable," manuscript, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois (1979).

    Google Scholar 

  67. R. Saigal and M.J. Todd, "Efficient acceleration techniques for fixed point algorithms," SIAM J. Numer. Anal. 15, 997–1007 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  68. H. Scarf, "The core of an N-person game," Econometrica 35, 50–69 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  69. _____ "The approximation of fixed points of a continuous mapping," SIAM J. Appl. Math. 15, 1328–1343 (1967).

    Article  MathSciNet  MATH  Google Scholar 

  70. _____ "The computation of equilibrium prices," to appear in the proceedings of a conference on Applied General Equilibrium Analysis held in San Diego, California (1981).

    Google Scholar 

  71. H.E. Scarf with T. Hansen, Computation of economic equilibria, Yale University Press, New Haven, Connecticut (1973).

    Google Scholar 

  72. S. Shamir, "Two new triangulations for homotopy fixed point algorithms with an arbitrary grid refinement," in Analysis and Computation of Fixed Points, S.M. Robinson, ed., Academic Press, New York (1980).

    Google Scholar 

  73. L.S. Shapley, "On balanced games without side payments," in Mathematical Programming, T.C. Hu and S.M. Robinson, eds., Academic Press, New York (1972).

    Google Scholar 

  74. S. Smale, "A convergent process of price adjustment and global Newton methods," J. Math. Econ. 3, 1–14 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  75. D. Solow, "Comparative computer results of a new complementary pivot algorithm for solving equality and inequality constrained optimization problems," Math. Program. 18, 169–185 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  76. M.J. Todd, The computation of fixed points and applications, Lect. Notes Econ. Math. Syst. 124, Springer-Verlag, Berlin (1976).

    MATH  Google Scholar 

  77. _____ "On triangulations for computing fixed points," Math. Program. 10, 322–346 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  78. _____ "Orientation in complementary pivoting," Math. Oper. Res. 1, 54–66 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  79. _____ "Union Jack triangulations," Fixed Points: Algorithms and Applications, S. Karamardian, ed., Academic Press, New York (1977).

    Google Scholar 

  80. _____ "Improving the convergence of fixed-point algorithms, Math. Program. Stud. 7, M.L. Balinski and R.W. Cottle, eds., North Holland, Amsterdam, 151–169 (1978).

    Google Scholar 

  81. _____ "Fixed-point algorithms that allow restarting without an extra dimension," School of Operations Research and Industrial Engineering, College of Engineering, Cornell University, Ithaca, NY, Technical Report No. 379 (1978).

    Google Scholar 

  82. _____ "Optimal dissection of simplices," SIAM J. Appl. Math. 34, 792–803 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  83. _____ "Global and local convergence and monotonicity results for a recent variable-dimension simplicial algorithm," in Numerical Solution of Highly Nonlinear Problems, W. Forster, ed., North-Holland, Amsterdam (1980).

    Google Scholar 

  84. _____ "Exploiting structure in piecewise-linear homotopy algorithms for solving equations," Math. Program. 18, 233–247 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  85. _____ "Traversing large pieces of linearity in algorithms that solve equations by following piecewise-linear paths," Math. Oper. Res. 5, 242–257 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  86. _____ "Numerical stability and sparsity in piecewise-linear algorithms," in Analysis and Computation of Fixed Points, S.M. Robinson, ed., Academic Press, New York (1980).

    Google Scholar 

  87. _____ "On the computational complexity of piecewise-linear homotopy algorithms," manuscript, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge (1981).

    Google Scholar 

  88. _____ "Efficient methods of computing economic equilibria," to appear in the proceedings of a conference on Applied General Equilibrium Analysis held in San Diego, California (1981).

    Google Scholar 

  89. _____ "Piecewise-linear homotopy algorithms for sparse systems of nonlinear equations," Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1981).

    Google Scholar 

  90. _____ "PLALGO: a FORTRAN implementation of a piecewise-linear homotopy algorithm for solving systems of nonlinear equations," Techical Report (revised), School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York (1981).

    Google Scholar 

  91. M.J. Todd and R. Acar, "A note on optimally dissecting simplices," Math. Oper. Res. 5, 63–66 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  92. M.J. Todd and A.H. Wright, "A variable-dimension simplicial algorithm for antipodal fixed-point theorems," Numer. Funct. Anal. Optimization 2, 155–186 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  93. H. Tuy, Ng. v. Thoai and L.d. Muu, "A modification of Scarf's algorithm allowing restarting," Math. Operationsforsch. Statist., Ser. Optimization 9, 357–372 (1978).

    Article  MATH  Google Scholar 

  94. L. van der Heyden, "Restricted primitive sets in a regularly distributed list of vectors and simplicial subdivisions with arbitrary refinement factors," Discussion Paper Series No. 79D, Kennedy School of Government, Harvard University, Cambridge, Massachusetts (1980).

    Google Scholar 

  95. H. Wacker, ed., Continuation methods, Academic Press, New York (1978).

    MATH  Google Scholar 

  96. L.T. Watson, "Computational experience with the Chow-Yorke algorithm," Math. Program. 19, 92–101 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  97. L.T. Watson and D. Fenner, "Chow-Yorke algorithm for fixed points or zeros of C2 maps," ACM Trans. Math. Software 6, 252–260 (1980).

    Article  MATH  Google Scholar 

  98. A.H. Wright, "The octahedral algorithm, a new simplicial fixed point algorithm," Math. Program. 21, 47–69 (1981).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Michael J. Todd
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter R. Turner

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Spring-Verlag

About this paper

Cite this paper

Todd, M.J. (1982). An introduction to piecewise-linear homotopy algorithms for solving systems of equations. In: Turner, P.R. (eds) Topics in Numerical Analysis. Lecture Notes in Mathematics, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0063203

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11967-8

  • Online ISBN: 978-3-540-39558-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation