Geodesic
Mixed global and local search methods as optimization algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 36 (1996) no. 9, pp. 50-59 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1996_36_9_a5,
     author = {A. S. Tikhomirov},
     title = {Mixed global and local search methods as optimization algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {50--59},
     year = {1996},
     volume = {36},
     number = {9},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_9_a5/}
}
TY  - JOUR
AU  - A. S. Tikhomirov
TI  - Mixed global and local search methods as optimization algorithms
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1996
SP  - 50
EP  - 59
VL  - 36
IS  - 9
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_9_a5/
LA  - ru
ID  - ZVMMF_1996_36_9_a5
ER  - 
%0 Journal Article
%A A. S. Tikhomirov
%T Mixed global and local search methods as optimization algorithms
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1996
%P 50-59
%V 36
%N 9
%U http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_9_a5/
%G ru
%F ZVMMF_1996_36_9_a5
A. S. Tikhomirov. Mixed global and local search methods as optimization algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 36 (1996) no. 9, pp. 50-59. http://geodesic.mathdoc.fr/item/ZVMMF_1996_36_9_a5/

[1] Nekrutkin U. U., Tikhomirov A. S., “Speed of convergence as a function of given accuracy for random search methods”, Acta Applic. Math., 33 (1993), 89–108 | DOI | MR | Zbl

[2] Tikhomirov A. S., “Markov sequences as optimization algorithms”, Model-Oriented Data Analys., Proc. 3-d Internat. Workshop (Petrodvorets, Russia, 25–30 May, 1992), Phys.-Verl., Heidelberg, 1993, 249–256 | MR | Zbl

[3] Karmanov V. G., Matematicheskoe programmirovanie, Nauka, M., 1986 | MR

[4] Venttsel A. D., Kurs teorii sluchainykh protsessov, Nauka, M., 1975 | MR | Zbl

[5] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983 | MR

[6] Nekrutkin V. V., Tikhomirov A. S., “Nekotorye svoistva globalnogo markovskogo sluchainogo poiska”, Vestn. LGU. Ser. 1, 1989, no. 3(15), 23–26 | MR

[7] Tikhomirov A. S., “O trudoemkosti poiska ekstremuma funktsii”, Vestn. SPbGU. Ser. 1, 1992, no. 3(15), 106–107 | MR

[8] Tikhomirov A. S., “Mixtures of global and local search methods as optimization algorithms”, Math. Meth. and Tools in Comput. Simulation, Internat. Workshop (Saint Petersburg, May 24–28, 1994), 74–75

[9] Zhiglyavskii A. A., Zhilinskas A. G., Metody poiska globalnogo ekstremuma, Nauka, M., 1991 | MR

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

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

[12] Ivanov V. V., “Ob optimalnykh algoritmakh minimizatsii funktsii nekotorykh klassov”, Kibernetika, 1972, no. 4, 81–94 | Zbl

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

[14] Hall P., “On estimating the endpoint of a distribution”, Ann. Statist., 10:2 (1982), 556–568 | DOI | MR | Zbl

[15] Vaisbord E. M., Yudin D. B., “Mnogoekstremalnaya stokhasticheskaya approksimatsiya”, Izv. AN SSSR. Tekhn. kibernetika, 1968, no. 5, 3–13 | MR

[16] Zhilinskas A. G., Globalnaya optimizatsiya. Aksiomatika statisticheskikh modelei, algoritmy, primeneniya, Mokslas, Vilnyus, 1986 | MR