Geodesic
Approximate search for a global minimum in problems of mathematical programming that are close to convex
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 3, pp. 386-417 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1999_39_3_a4,
     author = {V. V. Voloshinov and E. S. Levitin},
     title = {Approximate search for a global minimum in problems of mathematical programming that are close to convex},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {386--417},
     year = {1999},
     volume = {39},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_3_a4/}
}
TY  - JOUR
AU  - V. V. Voloshinov
AU  - E. S. Levitin
TI  - Approximate search for a global minimum in problems of mathematical programming that are close to convex
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 386
EP  - 417
VL  - 39
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_3_a4/
LA  - ru
ID  - ZVMMF_1999_39_3_a4
ER  - 
%0 Journal Article
%A V. V. Voloshinov
%A E. S. Levitin
%T Approximate search for a global minimum in problems of mathematical programming that are close to convex
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 386-417
%V 39
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_3_a4/
%G ru
%F ZVMMF_1999_39_3_a4
V. V. Voloshinov; E. S. Levitin. Approximate search for a global minimum in problems of mathematical programming that are close to convex. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 3, pp. 386-417. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_3_a4/

[1] Levitin E. S., “Ob asimptoticheskom metode resheniya zadach optimizatsii, soderzhaschikh malye parametry”, Modeli i metody optimizatsii, 7, VNIISI, M., 1990, 28–42

[2] Levitin E. S., Teoriya vozmuschenii v matematicheskom programmirovanii i ee prilozheniya, Nauka, M., 1992 | MR | Zbl

[3] Voloshinov V. V., Levitin E. S., “Priblizhennaya globalnaya minimizatsiya nevypuklykh funktsii, blizkikh k vypuklym”, Zh. vychisl. matem. i matem. fiz., 37:7 (1997), 771–784 | MR | Zbl

[4] Levitin E. S., “Teoriya vozmuschenii ekstremalnykh zadach s obobschenno-vypuklym obrazom”, Chisl. metody v zadachakh optimalnogo ekonomich. planirovaniya, 1, VNIISI, M., 1983, 34–54

[5] Eremin I. I., Astafev N. N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya, Nauka, M., 1976 | MR

[6] Voloshinov V. V., Levitin E. S., “Priblizhennyi poisk globalnogo minimuma v zadachakh matematicheskogo programmirovaniya, blizkikh k vypuklym”, Tr. XI mezhdunar. Baikalskoi shkoly-seminara (Irkutsk, Baikal, 5–12 iyulya 1998 g.), v. 1, Irkutsk, 1998, 192–195

[7] Leikhtveis K., Vypuklye mnozhestva, Nauka, M., 1985 | MR