History of mathematical programming in the USSR: Analyzing the phenomenon

Mathematical Programming, Series B

Volumn 91, Issue 3, 2002, Pages 401-416

  Polyak, B T ^a  

^a TRAPEZNIKOV INSTITUTE OF CONTROL SCIENCES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING;

HISTORIANS; REMINISCENCES;

MATHEMATICAL PROGRAMMING;

EID: 33751106955     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100258     Document Type: Review

References (73)

1. Karmanov, V.G. (1975): Mathematical Programming. Moscow, Nauka, 272 pp.
2. Tikhomirov, V.M. (1986): Stories on Maxima and Minima. Moscow, Nauka, 190 pp.
3. Demidov, S.S., Levshin, B.V., eds. (1999): The Case of Academician N.N. Luzin. St. Petersburg, RHGI, 310pp.
4. Esenin-Volpin, A.S. (1999): Philosophy, Logic, Poetry, Protection of Human Rights. Moscow, RGGU, 450 pp.
5. Freiman, G. (1980): It Seems, I am a Jew. South. Illinois Univ. Press, Feffer & Simons, Inc., 97 pp.
6. Vershik, A. (1994): Admission to the mathematical faculty in Russia in the 1970s and 1980s. Math. Intelligencer 16(4), 4-5
7. Shen, A. (1994): Entrance examinations to the Mekh-mat. Math. Intelligencer 16(4), 6-10
8. Zdravkovska, S., Duren, P.L., eds. (1993): Golden years of Moscow Mathematics. Amer. Math. Soc. and London Math. Soc.
9. Yushkevich, A.P. (1968): History of Mathematics in Russia before 1917. Moscow, Nauka, 592 pp.
10. Euler, L. (1744): Methodus inveniendi lineas curvas maximi minimive propietate gaudentes, sive solutio problematis isoperimetrici latissimo sensu accepti. Lausannae et Genevae (in Latin).
11. Russian translation: Euler, L. (1934): A Method for Finding Curves Having the Property of Maximum or Minimum, or a Solution of the Isoperimetric Problem Considered in the Very Broadest Sense. Moscow-Leningrad, Academy of Sciences
12. Mathematics in the USSR for Forty Years, 1917-1957. Moscow, GIFML, 1959, Vol. 1, 1002 pp., Vol. 2, 819 pp.
13. Mathematics in the USSR, 1958-1967. Moscow, GIFML, 1969, Vols. 1-2, 1579 pp.
14. Leifman, L.J., ed. (1990): Functional Analysis, Optimization, and Mathematical Economics: A Collection of Papers Dedicated to the Memory of Leonid Vital'evich Kantorovich. Oxford University Press
15. Romanovskii, I.V. (1989): L.V. Kantorovich's works in mathematical programming. In: Iri, M., Tanabe, K., eds., Mathematical Programming: Recent Developments and Applications. Tokyo, Kluwer, pp. 365-382
16. Kantorovich, L.V. (1987): My way in science. Uspekhi Matem. Nauk 42(2), 183-213
17. Katzenelinboigen, A. (1997): L.V. Kantorovich -a political dilemma in scientific activity. Ekonom. i Matem. Metody 33(3), 30-42
18. Kantorovich, L.V. (1939): Mathematical Methods for Production Organization and Planning. Leningrad, 64 pp.
19. Kantorovich, L.V. (1940): On an efficient method for solving some classes of extremum problems. Doklady AN SSSR 28, 212-215
20. Kantorovich, L.V. (1948): Functional analysis and applied mathematics. Uspekhi Matem. Nauk 6(3), 89-185
21. Kantorovich, L.V. (1960): Economical Calculation of the Best Utilization of Resources. Moscow, Academy of Sciences, 347 pp.
22. Chernikov, S.N. (1968): Linear Inequalities. Moscow, Nauka, 488 pp.
23. Remez, E. Ya. (1969): Foundations of Numerical Methods for Chebyshev Approximation. Kiev, Naukova Dumka, 623 pp.
24. Zukhovitskii, S.I. (1956): On the approximation of real functions in the sense of P.L. Chebyshev. Uspekhi Matem. Nauk 11 (2), 125-159
25. Akhiezer, N.I. (1961): The Classical Problem of Moments. Moscow, Fizmatgiz, 310 pp.
26. Krein, M.G., Nudelman, A.A. (1973): Markov's Problem of Moments and Extremum Problems. Moscow, Nauka, 551 pp.
27. Rubinstein, G.Sh. (1955): Problem on the extreme point of intersection of an axis with a polytope. Dokl. AN SSSR 115(3), 627-630
28. Linejnye neravenstva i smejnye voprosy. (pod red. H. Kuhn i A. Tucker) Moscow, IL, 1959;
29. Russian translation of: Linear Inequalities and Related Systems. Kuhn, H., Tucker, A., eds., Ann. Math. Studies, No. 38, Princeton, Princeton Univ. Press, 1956
30. Yudin, D.B., Golstein, E.G. (1961): Problems and Methods of Linear Programming. Moscow, Sov. Radio, 491 pp.
31. Ventzel, E.S. (1959): Elements of Game Theory. Moscow, Fizmatgiz
32. Pontryagin, L.S., Boltyanskii, V.G., Gamkrelidze, R.V., Mischenko, E.F. (1961): Mathematical Theory of Optimal Processes. Moscow, Nauka
33. Dubovitskii, A.Ya., Miljutin, A.A. (1963): Extremum problems under constraints. Dokl. AN SSSR 149(4), 759-762
34. Boltyanskii, V.G. (1975): Method of tents in the theory of extremum problems. Uspekhi Matem. Nauk 30(3), 3-55
35. Girsanov, I.V. (1970): Lectures on the Mathematical Theory of Extremum Problems. Moscow, Moscow State Univ., 118 pp.
36. Pshenichnyj, B.N. (1969): Necessary Conditions for Extrema. Moscow, Nauka, 152 pp.
37. Pshenichnyj, B.N. (1980): Convex Analysis and Extremum Problems. Moscow, Nauka, 320 pp.
38. Golstein, E.G. (1971): Duality Theory in Mathematical Programming and Its Applications. Moscow, Nauka, 352 pp.
39. Ioffe, A.D., Tikhomirov, V.M. (1974): Theory of Extremum Problems. Moscow, Nauka, 479 pp.
40. Levitin, E.S., Polyak, B.T. (1966): Minimization methods under constraints. Zhurn. Vychisl. Matem. i Matem. Fiz. 6(5), 787-823
41. Demyanov, V.F., Rubinov, A.M. (1968): Approximate Methods for Solving Extremum Problems. Leningrad, Leningr. State Univ., 180 pp.
42. Pshenichnyj, B.N., Danilin, Yu.M. (1957): Numerical Methods in Extremum Problems. Moscow, Nauka, 320 pp.
43. Vasiliev, F.P. (1974): Lectures on the Methods for Solving Extremum Problems. Moscow, Moscow State Univ., 374 pp.
44. Polyak, B.T. (1983): Introduction to Optimization. Moscow, Nauka, 384 pp.
45. Shor, N.Z. (1991): The development of numerical methods for nonsmooth optimization in the USSR. In: Lenstra, J.K., Rinnoy Kan, A.H.G., Shrijver, A., eds., History of Mathematical Programming. Amsterdam, CWI, North-Holland, pp. 135-139
46. Ermoliev, Yu. (1966): Methods for solving nonlinear extremum problems. Kibernetika 4, 1-17
47. Polyak, B.T. (1967): A general method for solving extremum problems. Dokl. AN SSSR 174(1), 33-36
48. Polyak, B.T. (1969): Minimization of nonsmooth functionals. Zhum. Vychisl. Matern, i Matern. Fiz. 9(3), 509-521
49. Shor, N.Z. (1979): Minimization Methods for Nondifferentiable Functions and Their Applications. Kiev, Naukova Dumka, 200 pp.
50. Levin, A.Yu. (1965): On an algorithm for minimization of convex functions. Dokl. AN SSSR 160(6), 1244-1247
51. Demyanov, V.F., Malozemov, V.N. (1972): Introduction to Minimax. Moscow, Nauka, 368 pp.
52. Demyanov, V.F., Vasiliev, P.V. (1981): Nondifferentiable Optimization. Moscow, Nauka, 384 pp.
53. Ermoliev, Yu.M. (1976): Stochastic Programming Methods. Moscow, Nauka, 240 pp.
54. Tsypkin, Ya.Z. (1968): Adaptation and Learning in Automatic Systems. Moscow, Nauka, 400 pp.
55. Rastrigin, L.A. (1968): Statistical Methods for Finding Extrema. Moscow, Nauka, 376 pp.
56. Yudin, D.B. (1979): Problems and Methods of Stochastic Programming. Moscow, Sov. Radio
57. Golstein, E.G., Yudin, D.B. (1966): New Directions in Linear Programming. Moscow, Sov. Radio, 524 pp.
58. Dikin, I. (1967): An iterative solution of problems of linear and quadratic programming. Dokl. AN SSSR 174(4), 747-748
59. Polyak, B.T., Tretyakov, N.V. (1972): On an iterative method of linear programming and its economic interpretation. Econom. i Matem. Metody 8(5), 740-751
60. Belenkii, V.Z., Volkonskii, V.A., a.o. (1974): Iterative Methods in Games Theory and Programming. Moscow, Nauka
61. Korbut, A.A., Finkelstein, Yu.Yu. (1969): Discrete Programming. Moscow, Nauka
62. Nemirovskii, A.S., Yudin, D.B. (1979). Complexity of Problems and Efficiency of Optimization Methods. Moscow, Nauka, 383 pp.
63. Nesterov, Yu.E. (1989): Effective Methods in Nonlinear Programming. Moscow, Radio i Svyaz, 301 pp.
64. Yudin, D.B., Nemirovskii, A.S. (1976): Information complexity and effective methods for solving convex extremum problems. Ekonom. i Matem. Metody 12(2), 357-369
65. Shor, N.Z. (1977): A cutting method with space dilation for solving convex programming problems. Kibernetika 1, 42-50
66. Khachyan, L.G. (1979): Polynomial methods in linear programming. Dokl. AN SSSR 244(5), 1093-1096
67. Karmarkar, N. (1984): A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-395
68. Nesterov, Yu.E., Nemirovskii, A.S. (1994): Interior-Point Polynomial Algorithms in Convex Programming. Philadelphia, SIAM, 405 pp.
69. Saigal, R., Vanderberghe, L., Wolkowitz, H., eds. (2000): Handbook of Semidefinite Programming. Waterloo, Kluwer
70. Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V. (1994): Linear Matrix Inequalities in Systems and Control Theory. Philadelphia, SIAM, 193 pp.
71. Mordukhovich, B.Sh. (1988): Approximation Methods in Optimization and Control Problems. Moscow, Nauka, 359 pp.
72. Ioffe, A.D. (1981): Nonsmooth analysis: differential calculus of nondifferentiable mapping. Trans. Amer. Math. Soc. 266(1), 1-56
73. Levitin, E.S. (1992): Perturbation Theory in Mathematical Programming and Its Applications. Moscow, Nauka, 360 pp.