The evolution of methods of convex optimization

American Mathematical Monthly

Volumn 103, Issue 1, 1996, Pages 65-71

  Tikhomirov, V M ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030558767     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2975217     Document Type: Article

References (21)

1. G. B. Dantzig, Linear Programming and Extensions, Princeton, Univ. Press, 1963.
2. Kantorovich, L. V. Mathematical methods in the organization and planning of production. Leningrad University, 1939. [Russian] For an English version see Management Science, Vol. 6, 1960, 366-422.
3. Kantorovich, L. V. Mathematical methods in the organization and planning of production. Leningrad University, 1939. [Russian] For an English version see Management Science, Vol. 6, 1960, 366-422.
4. History of Mathematical Programming (A Collection of Personal Reminiscences). Ed. by J. K. Lenstra, F. H. G. Rinnooy Kan, A. Schrijver, North-Holland, 1991.
5. Yudin, D. B. and Gol'shtein, E. G. Problems and methods of linear programming. Moscow. Sovradio, 1961. [Russian]
6. Levin, A. Yu. On an algorithm for the minimization of convex functions. DAN USSR vol. 160, issue 6, 1965, pp. 1244-1247. [Russian]
7. Newman, D. J. Location of maximum on unimodal surfaces. Journ. of the Assoc. for Computing Machinery 12, 1965, pp. 395-398.
8. Kuzovkin, A. I. and Tikhomirov, V. M. On the number of computations needed for finding the minimum of a convex function. Economics and mathematical methods, 3:1, 1967, pp. 95-103. [Russian]
9. Yudin, D. B. and Nemirovski, A. S. Informational complexity and effective methods of solution of convex extremal problems. Economics and mathematical methods vol. 12, issue 1, 1976, pp. 357-369. [Russian]
10. Khachian, L. G. A polynomial algorithm in linear programming. DAN USSR vol. 244, issue 5, 1979, pp. 1093-1096 [Russian]. For an English version see Soviet Math. Doklady 20, 1979, 191-194.
11. Khachian, L. G. A polynomial algorithm in linear programming. DAN USSR vol. 244, issue 5, 1979, pp. 1093-1096 [Russian]. For an English version see Soviet Math. Doklady 20, 1979, 191-194.
12. Yamnitsky, B., Levin, L. An Old Linear Programming Algorithm Runs in Polynomial Time. In 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 327-328.
13. Nemirovsky, A., Nesterov, Yu. Interior-Point Polynomial Algorithms in Convex programming. SIAM Studies in Applied Math., 1994.
14. Nemirovsky, A. S., Yudin, D. B. Problem Complexity and Method Efficiency in Optimization. John Wiley and Sons, Chichester, 1983.
15. Grötschel, M., Lovász, L., Schrijver, A. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.
16. Schrijver, A. Theory of Linear and Integer Programming. John Wiley and Sons, 1986.
17. Shor, N. Z. Minimization Methods for Nondifferentiable Functions. Springer-Verlag, Berlin, 1985.
18. Bland, R. G., Goldfarb, D., Todd, M. J. The ellipsoid method: a survey. Operations Research, 29 (1981), 1039-1091.
19. Goldfarb, D., Todd, M. J. Linear programming in "Handbooks in Operations Research and Management Science," vol. 1, Optimization (G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd, eds.), North Holland, Amsterdam, 1989, 73-170.
20. Shor, N. Z. Cut-off method with space extension in convex programming problems, Cybernetics, 13 (1977), 94-96.
21. Tarasov, S. P., Khachiyan, L. G., Erlikh, I. I. The method of inscribed ellipsoids. Soviet Math. Doklady, 37 (1988), 226-230.