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

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

@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},
     publisher = {mathdoc},
     volume = {39},
     number = {3},
     year = {1999},
     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
PB  - mathdoc
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
%I mathdoc
%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/