1. A. Auslender,Problèmes de Minimax via l'Analyse Convexe et les Inegalités Variationnelles: Théorie et Algorithmes, Lecture Notes in Economics and Mathematical Systems (Springer, Berlin, 1972).
2. E.W. Cheney and A.A. Goldstein, “Newton's methods for convex programming and Tchebytcheff approximation,”Numerische Mathematik 1 (1959) 253–268.
3. Yu.M. Ermoliev, “Methods for solving nonlinear extremal problems,”Cybernetics 4 (1966) 1–17 (in Russian).
4. M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees: Part II,”Mathematical Programming 1 (1971) 6–25.
5. P. Huard, “Resolution of mathematical programming problems with nonlinear constraints by the method of centers,” in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) 206–219.