Skip to main content

A restart algorithm without an artificial level for computing fixed points on unbounded regions

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

Keywords

  • Price Vector
  • Pivot Step
  • Demand Vector
  • Sandwich Method
  • Unbounded Region

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • 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. Colville, A.R., "A Comparitive Study on Nonlinear Programming Codes", I.B.M.New York Scientific Center Report, no. 320-2949, June 1968.

    Google Scholar 

  2. Kuhn, H.W. and MacKinnon, J.G., "Sandwich method for Finding Fixed Points", Journal of Optimization Theory and Applications, Vol. 17, pp. 189–204, 1975.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Laan, G. van der, and Talman, A.J.J., "A New Algorithm for Computing Fixed Points", Submitted to Mathematical Programming.

    Google Scholar 

  4. Merrill, O.H., "Applications and Extensions of an Algorithm that Computes Fixed Points of Certain Upper Semi-continuous Point to Set Mappings", Ph.D. Dissertation, University of Michigan, 1972.

    Google Scholar 

  5. Saigal, R., "Investigations into the Efficiency of the Fixed Point Algorithms", Fixed Points: Algorithms and Applications, S. Karamardian, Ed., Academic Press, New York, pp. 203–223, 1977.

    CrossRef  Google Scholar 

  6. —, "On the Convergence of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting", Mathematics of Operations Research, Vol. 2, pp. 108–124, 1977.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Scarf, H., "The Approximation of Fixed Points of a Continuous Mapping", SIAM Journal of Applied Mathematics, Vol. 15, pp. 1328–1343, 1967.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. —, "The Computation of Economic Equilibria" (with the collaboration of T. Hansen), Yale University Press, New Haven, Connecticut, 1973.

    MATH  Google Scholar 

  9. Todd, M.J., "On Triangulations for Computing Fixed Points", Mathematical Programming, Vol. 10, pp. 322–346, 1976.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. —, "Union Jack Triangulations", Fixed Points: Algorithms and Applications, S. Karamardian, Ed., Academic Press, New York, pp. 315–336, 1977.

    CrossRef  Google Scholar 

  11. —, "Improving the Convergence of Fixed-Point Algorithms" Mathematical Programming Study, Vol. 7, pp. 151–169, 1978.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Wilmuth, R.J., "A Computational Comparison of Fixed Point Algorithms Which Use Complementary Pivoting", Fixed Points: Algorithms and Applications, S. Karamardian, Ed., Academic Press, New York, pp. 249–280, 1977.

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

van der Laan, G., Talman, A.J.J. (1979). A restart algorithm without an artificial level for computing fixed points on unbounded regions. In: Peitgen, HO., Walther, HO. (eds) Functional Differential Equations and Approximation of Fixed Points. Lecture Notes in Mathematics, vol 730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0064322

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09518-7

  • Online ISBN: 978-3-540-35129-0

  • eBook Packages: Springer Book Archive