Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Belousov E. G., Andronov V. G., Razreshimost i ustoichivost zadach polinomialnogo programmirovaniya, Izd-vo MGU, M., 1993 | MR | Zbl
[2] E. G. Belousov, B. Bank (red.), Matematicheskaya optimizatsiya: voprosy razreshimosti i ustoichivosti, Izd-vo MGU, M., 1986
[3] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988 | MR
[4] Bank B., Guddat J., Klatte D. et al., Non-linear parametric optimization, Akad. Verl., Berlin, 1982
[5] Andronov V. G., Belousov E. G., “O nepreryvnosti optimalnogo otobrazheniya zadachi vypuklogo programmirovaniya”, Vestn. MGU. Ser. 15. Vychisl. matem. i kibernetika, 1995, no. 2, 18–22 | MR | Zbl
[6] Belousov E. G., Andronov V. G., “Teoremy o skhodimosti po funktsionalu metoda shtrafnykh funktsii”, Vestn. MGU. Ser. 15. Vychisl. matem. i kibernetika, 1997, no. 4, 21–25 | MR
[7] Andronov V. G., Belousov E. G., “O berzhevoi skhodimosti po argumentu metoda shtrafnykh funktsii”, Zh. vychisl. matem. i matem. fiz., 38:4 (1998), 573–589 | MR | Zbl