A Hybrid Algorithm for the Computation of Fixed Points
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.
Year of publication: |
1976
|
---|---|
Authors: | Garcia, C. B. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 22.1976, 5, p. 606-613
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A simple model for the study of shorting stocks
Garcia, C. B., (2009)
-
A PL homotopy method for the linear complementarity problem
Garcia, C. B., (1984)
-
Contingent-capital solutions for mitigating the investment risks of a private placement stock
Garcia, C. B., (2011)
- More ...