A Computational Comparison of Fixed Point Algorithms Which Use Complementary Pivoting

The recently developed collection of algorithms which use the technique of complementary pivoting on a complex for computing fixed points of functions is considered. The results of a study comparing their relative computational performance on fixed point problems from economics and nonlinear programming are given.

[1]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points on unbounded regions , 1972, Math. Program..

[2]  B. Curtis Eaves,et al.  Homotopies for computation of fixed points , 1972, Math. Program..

[3]  B. Eaves.  Computing Kakutani Fixed Points , 1971 .

[4]  Herbert E. Scarf,et al.  The Approximation of Fixed Points of a Continuous Mapping , 1967 .

[5]  C. E. Lemke,et al.  Equilibrium Points of Bimatrix Games , 1964 .

[6]  H. Kuhn.  Simplicial approximation of fixed points. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[7]  B. Eaves.  An odd theorem , 1970 .