Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Evtushenko Yu. G., Zhadan V. G., “Relaksatsionnyi metod resheniya zadach nelineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 17:4 (1977), 890–904 | MR | Zbl
[2] Evtushenko Yu. G., Zhadan V. G., Barerno-proektivnye i barerno-nyutonovskie chislennye metody optimizatsii (sluchai nelineinogo programmirovaniya), VTs RAN, M., 1991
[3] Evtushenko Yu. G., Zhadan V. G., Barerno-proektivnye i barerno-nyutonovskie chislennye metody optimizatsii (sluchai lineinogo programmirovaniya), VTs RAN, M., 1992
[4] Evtushenko Yu. G., Zhadan V. G., “Dvoistvennye barerno-proektivnye i barerno-nyutonovskie metody dlya zadach lineinogo programmirovaniya”, Zh. vychisl. matem. i matem. fiz., 36:7 (1996), 30–45 | MR | Zbl
[5] Malkin I. G., Teoriya ustoichivosti dvizheniya, Nauka, M., 1996
[6] Smirnov G. V., “Convergence of barrier-projection methods of optimization via vector Lyapunov functions”, Optimizat. Meth. and Software, 3 (1994), 153–162 | DOI
[7] Barnes E. R., “A variation on Karmarkar's algorithm for solving linear programming problems”, Math. Program., 36 (1988), 174–182 | DOI