1. B. N. Pshenichnyi, “The duality principle in problems of convex programming,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, 5, 1, 1965.
2. G. B. Dantzig, L. R. Ford, and D. R. Falkerson, “A primal-dual algorithm for linear programs,” In: Linear Inequalities [Russian translation], IL, 1959.
3. S. I. Zhkhovitskii, R. A. Polyak, and M. E. Primak, “An algorithm for problems on convex Chebyshev approximation,” DAN SSSR, 151, 1, 1963.
4. J. Warga, “A convergent procedure for convex programming,” Journal of the Society for Industrial and Applied Mathematics, vol. 11, no. 3, pp. 579–587, 1963.
5. M. A. Krasnosel'skii and Ya. B. Rutitskii, Convex Functions and Orlicz Spaces [in Russian], Fizmatgiz, Moscow, 1958.