1. Khachiyan LG (1979) A polynomial algorithm in linear programming. Dokl Akad Nauk SSSR 244:1093–1096. (English translation: Sov Math Dokl, 20(1):191–194, 1979)
2. Yudin DB, Nemirovski AS (1976) Evaluation of the informational complexity of mathematical programming problems. Èkon Math Method 12:128–142. (English translation: Matekon, 13(2):3–25, 1976–7)
3. Yudin DB, Nemirovski AS (1976) Informational complexity and efficient methods for the solution of convex extremal problems. Èkon Math Method 12:357–369. (English translation: Matekon, 13(3):25–45, 1977)
4. Yudin DB, Nemirovski AS (1977) Optimization methods adapting to the “significant” dimension of the problem. Autom Telemekhanika 38(4):75–87. (English translation: Autom Remote Control, 38(4):513–524, 1977)
5. Shor NZ (1977) Cut-off method with space extension in convex programming problems. Kibern 13(1):94–95. (English translation: Cybern 13(1):94–96, 1977)