1. E. Allgower and K. Georg, “Simplicial and continuation methods for approximating fixed points and solutions to systems of equations,”SIAM Review 22 (1980) 28–85
2. A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).
3. M.R. Garey and D.S. Johnson,Computers and Intractability, A Guide to the Theory of NP-completeness (Freeman, New York, 1980).
4. O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).
5. O.H. Merrill, “Application and extensions of an alogirithm that computes fixed points of upper semicontinous point to set mappings” Ph.D. Dissertation, University of Michigan, Ann Arbor, MI (1972).