A Hybrid Algorithm for the Computation of Fixed Points

C. B. Garcia
Additional contact information
C. B. Garcia: University of Chicago

Management Science, 1976, vol. 22, issue 5, 606-613

Abstract: Given a continuous mapping of a simplex to itself, an algorithm is shown that generates an infinite sequence of points converging to a fixed point of the mapping. Taking advantage of a generalization of Sperners lemma, the proposed method generalizes those of Scarf and Eaves in a manner such that both methods are given a unifying formulation.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.5.606 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:22:y:1976:i:5:p:606-613

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().