Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Khachiyan L. G., “Polinomialnye algoritmy v lineinom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 20:1 (1980), 51–68 | MR | Zbl
[2] Antsiferov E. G., Bulatov V. P., “K polinomialnym metodam v vypuklom programmirovanii”, Optimizatsiya: modeli, metody, resheniya, Nauka, Novosibirsk, 1992, 4–28 | MR
[3] Kojima M., Mizuno S., Yoshise A., “A polynomial-time algorithm for a class of linear complimentarity problems”, Math. Program., 44 (1989), 1–26 | DOI | MR | Zbl
[4] Monteiro R., Adler I., “Interior path following primal-dual algorithms. Part 1: linear programming”, Math. Program., 44 (1989), 27–41 | DOI | MR | Zbl
[5] Rokafellar P., Vypuklyi analiz, Mir, M., 1973
[6] Fiakko A., Mak-Kormik G., Nelineinoe programmirovanie. Metody posledovatelnoi bezuslovnoi minimizatsii, Mir, M., 1972 | MR | Zbl
[7] Zorkaltsev V. I., Metod naimenshikh kvadratov: geometricheskie svoistva, alternativnye podkhody, prilozheniya, Nauka, Novosibirsk, 1995 | MR
[8] Zorkaltsev V. I., Nechaeva M. S., Optimizatsiya v konuse tsentralnogo puti, Preprint, Sibirskii energetich. in-t SO RAN, 1995, 24 pp.
[9] Zorkaltsev V. I., Filatov A. Yu., Issledovanie algoritmov optimizatsii v konuse tsentralnogo puti, Preprint, Sibirskii energetich. in-t SO RAN, 1997, 50 pp.