Geodesic
Estimating the information complexity of global optimization and the global solution of equations
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 12, pp. 1853-1868 
N. M. Popov. Estimating the information complexity of global optimization and the global solution of equations. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 12, pp. 1853-1868. http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a2/
@article{ZVMMF_1992_32_12_a2,
     author = {N. M. Popov},
     title = {Estimating the information complexity of global optimization and the global solution of equations},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1853--1868},
     year = {1992},
     volume = {32},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a2/}
}
TY  - JOUR
AU  - N. M. Popov
TI  - Estimating the information complexity of global optimization and the global solution of equations
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1992
SP  - 1853
EP  - 1868
VL  - 32
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a2/
LA  - ru
ID  - ZVMMF_1992_32_12_a2
ER  - 
%0 Journal Article
%A N. M. Popov
%T Estimating the information complexity of global optimization and the global solution of equations
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1992
%P 1853-1868
%V 32
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a2/
%G ru
%F ZVMMF_1992_32_12_a2

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

[1] Bakhvalov N. S., Chislennye metody, Nauka, M., 1973 | MR | Zbl

[2] Traub Dzh., Vozhnyakovskii Kh., Obschaya teoriya optimalnykh algoritmov, Mir, M., 1983 | MR | Zbl

[3] Sukharev A. G., Minimaksnye algoritmy v zadachakh chislennogo analiza, Nauka, M., 1989 | MR | Zbl

[4] Nemirovskii A. S., Yudin D. B., Slozhnost zadach i effektivnost metodov optimizatsii, Nauka, M., 1979 | MR

[5] Khachiyan L. G., “Problemy optimalnykh algoritmov v vypuklom programmirovanii, dekompozitsii i sortirovke”, Kompyuter i zadachi vybora, Nauka, M., 1989, 161–205 | MR | Zbl

[6] Vasilev N. S., “K otyskaniyu globalnogo minimuma kvazivognutoi funktsii”, Zh. vychisl. matem. i matem. fiz., 23:2 (1983), 307–313 | MR

[7] Perevozchikov A. G., “O slozhnosti vychisleniya globalnogo ekstremuma v odnom klasse mnogoekstremalnykh zadach”, Zh. vychisl. matem. i matem. fiz., 30:3 (1990), 379–387 | MR

[8] Popov N. M., “Ob otsenke vychislitelnoi slozhnosti mnogokriterialnoi optimizatsii”, Vychisl. kompleksy i modelirovanie slozhnykh sistem, Izd-vo MGU, M., 1989, 142–152

[9] Popov N. M., “Ob asimptoticheskoi optimalnosti nekotorykh algoritmov mnogokriterialnoi optimizatsii”, Programmnoe obespechenie i modeli sistemnogo analiza, Izd-vo MGU, M., 1991, 150–161

[10] Rodzhers K., Ukladki i pokrytiya, Mir, M., 1968 | MR

[11] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1988 | MR

[12] Popov N. M., “Priblizhennoe reshenie mnogokriterialnykh zadach s funktsionalnymi ogranicheniyami”, Zh. vychisl. matem. i matem. fiz., 26:10 (1986), 1468–1481 | MR | Zbl