Geodesic
Optimal Markov monotone symmetric random search
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 12, pp. 1973-1982 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_12_a3,
     author = {A. S. Tikhomirov},
     title = {Optimal {Markov} monotone symmetric random search},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1973--1982},
     year = {1998},
     volume = {38},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_12_a3/}
}
TY  - JOUR
AU  - A. S. Tikhomirov
TI  - Optimal Markov monotone symmetric random search
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 1973
EP  - 1982
VL  - 38
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_12_a3/
LA  - ru
ID  - ZVMMF_1998_38_12_a3
ER  - 
%0 Journal Article
%A A. S. Tikhomirov
%T Optimal Markov monotone symmetric random search
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 1973-1982
%V 38
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_12_a3/
%G ru
%F ZVMMF_1998_38_12_a3
A. S. Tikhomirov. Optimal Markov monotone symmetric random search. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 12, pp. 1973-1982. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_12_a3/

[1] Nekrutkin V. V., Tikhomirov A. S., “Speed of convergence as a function of iven 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 in Petrodvorets (Russia. 25–30 May 1992), Phys.-Verl., Heidelberg, 1993

[3] Tikhomirov A. S., “Smesi globalnykh i lokalnykh metodov poiska kak algoritmy optimizatsii”, Zh. vychisl. matem. i matem. fiz., 36:9 (1996), 50–59 | MR

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

[5] Tikhomirov A. S., “O skorosti skhodimosti markovskogo sluchainogo poiska”, Vestn. Novgorodskogo gos. un-ta. Ser. Estestv. i tekhn. nauki, 1996, no. 3, 90–92

[6] Tikhomirov A. S., “O skorosti skhodimosti monotonnogo markovskogo poiska”, Vestn. Novgorodskogo gos. un-ta. Ser. Estestv. i tekhn. nauki, 1997, no. 5, 66–68 | MR

[7] Tikhomirov A., “Optimal Markov search methods”, Math. Methods in Stochastic Simulation and Experimental Design, Proc. 2nd St. Petersburg Worskhop on Simulation (St. Petersburg, 18–21 June. 1996), Publ. House of St. Petersburg Univ., 1996, 328–330

[8] Sushkov Yu. A., “Ob odnom sposobe organizatsii sluchainogo poiska”, Issl. operatsii i statistich. modelirovanie, 1, Izd-vo LGU, L., 1972, 180–186

[9] Rastrigin L. A., Statisticheskie metody poiska, Nauka, M., 1968

[10] Zhiglyavskii A. A., Zhilinskas A. G., Metody poiska globalnogo ekstremuma, Nauka, M., 1991

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

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

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

[14] Karmanov V. G., Matematicheskoe programmirovanie, Nauka, M., 1986

[15] Billingsli P., Skhodimost veroyatnostnykh mer, Nauka, M., 1977

[16] Kolmogorov A. N., Fomin S. V., Elementy teorii funktsii i funktsionalnogo analiza, Nauka, M., 1989

[17] Shiryaev A. N., Veroyatnost, Nauka, M., 1989