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.

• 저널Management Science · 22(5) · 606–613
• 토픽Advanced Optimization Algorithms Research · Numerical Analysis
• DOI10.1287/mnsc.22.5.606
• 저자C. B. Garcia