Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2004_1_a5, author = {Ya. I. Zabotin and I. A. Fukin}, title = {Algorithms in the penalty method with approximation of the admissible set}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {36--47}, publisher = {mathdoc}, number = {1}, year = {2004}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_2004_1_a5/} }
TY - JOUR AU - Ya. I. Zabotin AU - I. A. Fukin TI - Algorithms in the penalty method with approximation of the admissible set JO - Izvestiâ vysših učebnyh zavedenij. Matematika PY - 2004 SP - 36 EP - 47 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IVM_2004_1_a5/ LA - ru ID - IVM_2004_1_a5 ER -
Ya. I. Zabotin; I. A. Fukin. Algorithms in the penalty method with approximation of the admissible set. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 1 (2004), pp. 36-47. http://geodesic.mathdoc.fr/item/IVM_2004_1_a5/
[1] Zabotin Ya. I., Fukin I. A., “Ob odnoi modifikatsii metoda sdviga shtrafov dlya zadach nelineinogo programmirovaniya”, Izv. vuzov. Matematika., 2000, no. 12, 49–54 | MR | Zbl
[2] Golshtein E. G., Tretyakov N. V., “Modifitsirovannye funktsii Lagranzha”, Ekonomika i matem. metody, 10:3 (1974), 568–591
[3] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986, 326 pp. | MR | Zbl
[4] Davydov E. G., Issledovanie operatsii, Vyssh. shkola, M., 1990, 383 pp.
[5] Fedorov V. V., Chislennye metody maksimina, Nauka, M., 1979, 280 pp. | MR
[6] Fukin I. A., “Reshenie zadachi lineinogo programmirovaniya s zadannoi tochnostyu metodom shtrafov”, Tr. mezhd. semin., posvyaschennogo 90-letiyu S.N. Chernikova, Algebra i lineinaya optimizatsiya, UrO RAN, Ekaterinburg, 2002, 309–313 | MR
[7] Fiakko A., Mak-Kormik G., Nelineinoe programmirovanie na osnove posledovatelnoi bezuslovnoi minimizatsii, Mir, M., 1972, 240 pp. | Zbl