Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Fedorov V. V., Chislennye metody maksimina, Nauka, M., 1979 | MR
[2] Nefedov V. N., “O regulyarizatsii leksikograficheskikh zadach metodom minimalnykh “ustupok””, Zh. vychisl. matem. i matem. fiz., 23:6 (1983), 1326–1340 | MR | Zbl
[3] Nefedov V. Ya., “Polinomialnye zadachi optimizatsii”, Zh. vychisl. matem. i matem. fiz., 27:5 (1987), 661–675 | MR | Zbl
[4] Nefedov V. N., Metod isklyucheniya peremennykh v polinomialnykh zadachakh optimizatsii, Dep. v VINITI, No 7590–84, 1984
[5] Krasnoselskii M. A., Vainikko G. M., Zabreiko P. P. i dr., Priblizhennoe reshenie operatornykh uravnenii, Nauka, M., 1969 | MR
[6] Belousov E. G., Bank B. (red.), Matematicheskaya optimizatsiya: voprosy razreshimosti i ustoichivosti, Izd-vo MGU, M., 1986
[7] Nefedov V. I., Metody svedeniya zadachi vypuklogo programmirovaniya, ne udovletvoryayuschei usloviyu Sleitera, k zadache vypuklogo programmirovaniya, udovletvoryayuschei usloviyu Sleitera, Dep. v VINITI, No 2092-V88, 1988