@article{ZVMMF_1994_34_5_a2,
author = {Yu. G. Evtushenko and V. G. Zhadan},
title = {Barrier-projective methods for nonlinear programming},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {669--684},
year = {1994},
volume = {34},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_5_a2/}
}
TY - JOUR AU - Yu. G. Evtushenko AU - V. G. Zhadan TI - Barrier-projective methods for nonlinear programming JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1994 SP - 669 EP - 684 VL - 34 IS - 5 UR - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_5_a2/ LA - ru ID - ZVMMF_1994_34_5_a2 ER -
Yu. G. Evtushenko; V. G. Zhadan. Barrier-projective methods for nonlinear programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 5, pp. 669-684. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_5_a2/
[1] Rozen J. B., “The gradient projection method for nonlinear programming. Part I: Linear constraints”, SIAM J. Appl. Math., 8:1 (1960), 181–217 ; Part II: Nonlinear constraints, 9:4 (1961), 514–532 | DOI | MR | DOI | MR
[2] Levitin E. S., Polyak B. T., “Metody minimizatsii pri nalichii ogranichenii”, Zh. vychisl. matem. i matem. fiz., 6:5 (1966), 787–823 | MR | Zbl
[3] Demyanov V. F., Rubinov A. M., Priblizhennye metody resheniya ekstremalnykh zadach, Izd-vo LGU, L., 1968
[4] Antipin A. S., “Nepreryvnye i iterativnye protsessy s operatorami proektirovaniya”, Vopr. kibernetiki. Vychisl. vopr. analiza bolshikh sistem, Nauka, M., 1989, 1–43
[5] Tanabe K., “A geometric method in nonlinear programming”, J. Optimizat. Theory and Appl., 30:2 (1980), 181–210 | DOI | MR | Zbl
[6] Dikin I. I., “Iterativnoe reshenie zadach lineinogo i kvadratichnogo programmirovaniya”, Dokl. AN SSSR, 174:4 (1967), 745–747 | MR
[7] Dikin I. I., “O skhodimosti odnogo iteratsionnogo protsessa”, Upravlyaemye sistemy, 12, Novosibirsk, 1974, 54–60 | MR | Zbl
[8] Evtushenko Yu. G., Zhadan V. G., “Chislennye metody resheniya nekotorykh zadach issledovaniya operatsii”, Zh. vychisl. matem. i matem. fiz., 13:3 (1973), 583–597
[9] Evtushenko Yu. G., “Dva chislennykh metoda resheniya zadach nelineinogo programmirovaniya”, Dokl. AN SSSR, 215:1 (1974), 38–40 | MR | Zbl
[10] 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
[11] Evtushenko Yu. G., Metody resheniya ekstremalnykh zadach i ikh primenenie v sistemakh optimizatsii, Nauka, M., 1982 | MR | Zbl
[12] Evtushenko Yu. G., Zhadan V. G., “Barerno-proektivnye i barerno-nyutonovskie chislennye metody optimizatsii (sluchai nelineinogo programmirovaniya)”, Soobsch. po vychisl. matem., VTs AN SSSR, M., 1991
[13] Karmarcar N., “A new polinominal-time algorithm for linear programming”, Combinatorica, 4 (1984), 373–395 | DOI | MR
[14] Barnes E. R., “A variation on Karmarcar's algorithm for solving linear programming problems”, Math. Program., 36 (1986), 174–182 | DOI | MR | Zbl
[15] Vanderbei R. J., Meceton M. S., Freeman B. A., “On a modification of Karmarkars linear programming algorithm”, Algorithmica, 1 (1986), 395–407 | DOI | MR | Zbl
[16] Wei Zi-Luan, “An interior point method for linear programming”, J. Comput. Math., 1987. Oct., 342–350 | MR
[17] Fiakko A., Mak-Korlshk G., Nelineinoe programmirovanie. Metody posledovatelnoi bezuslovnoi minimizatsii, Mir, M., 1972 | MR | Zbl
[18] Ortega Dzh., Reinboldt V., Iteratsionnye metody resheniya nelineinykh sistem uravnenii so mnogimi neizvestnymi, Mir, M., 1975 | MR
[19] Zhadan V. G., “Modifitsirovannye funktsii Lagranzha v nelineinom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 22:2 (1982), 296–308 | MR | Zbl