Geodesic
On an efficient method for convex programming
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 1, pp. 51-61.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2004_11_1_a3,
     author = {V. P. Bulatov and N. I. Fedurina},
     title = {On an efficient method for convex programming},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {51--61},
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_1_a3/}
}
TY  - JOUR
AU  - V. P. Bulatov
AU  - N. I. Fedurina
TI  - On an efficient method for convex programming
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 51
EP  - 61
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_1_a3/
LA  - ru
ID  - DA_2004_11_1_a3
ER  - 
%0 Journal Article
%A V. P. Bulatov
%A N. I. Fedurina
%T On an efficient method for convex programming
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 51-61
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_1_a3/
%G ru
%F DA_2004_11_1_a3
V. P. Bulatov; N. I. Fedurina. On an efficient method for convex programming. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 1, pp. 51-61. http://geodesic.mathdoc.fr/item/DA_2004_11_1_a3/

[1] Antsiferov E. G., Bulatov V. P., “Algoritm simpleksnykh pogruzhenii v vypuklom programmirovanii”, Zhurn. vychisl. matem. i matem. fiz., 27:3 (1984), 348–385 | MR

[2] Aschepkov L. T., Belov B. I., Bulatov V. P., Metody resheniya zadach matematicheskogo programmirovaniya i optimalnogo upravleniya, Nauka, Novosibirsk, 1984

[3] Bulatov V. P., Fedurina N. I., “Ob odnom effektivnom metode vypuklogo programmirovaniya”, Materialy Vserossiiskoi konferentsii “Problemy i ekonomicheskie prilozheniya”, Omsk, 2003, 19–23

[4] Levin Yu. Ya., “Ob odnom algoritme minimizatsii vypuklykh funktsii”, Dokl. AN SSSR, 160:6 (1965), 1244–1247 | MR | Zbl

[5] Mityagin B. S., “Dva neravenstva dlya ob'emov vypuklykh tel”, Matematicheskie zametki, 5:5 (1965), 20–25

[6] Khachiyan L. G., “Problemy optimalnykh algoritmov v vypuklom programmirovanii, dekompozitsii i svertki”, Kompyuter i zadachi vybora, Nauka, M., 1989, 161–204 | MR

[7] Khachiyan L. G., “Polinomialnye algoritmy v lineinom programmirovanii”, Zhurn. vychisl. matem. i matem. fiz., 28:1 (1980), 51–69 | MR

[8] Shor N. Z., “Metody otsecheniya s rastyazheniem prostranstva dlya resheniya zadach vypuklogo programmirovaniya”, Kibernetika, 1977, no. 1, 94–95 | Zbl

[9] Yudin D. B., Nemirovskii A. S., “Informatsionnaya slozhnost i effektivnye metody resheniya vypuklykh ekstremalnykh zadach”, Ekonomika i mat. metody, 12:2 (1976), 357–369 | MR | Zbl