Geodesic
Numerical methods of successive elimination and optimization in stochastic optimal control
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 2, pp. 247-260 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1992_32_2_a5,
     author = {V. V. Baranov},
     title = {Numerical methods of successive elimination and optimization in stochastic optimal control},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {247--260},
     year = {1992},
     volume = {32},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_2_a5/}
}
TY  - JOUR
AU  - V. V. Baranov
TI  - Numerical methods of successive elimination and optimization in stochastic optimal control
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1992
SP  - 247
EP  - 260
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_2_a5/
LA  - ru
ID  - ZVMMF_1992_32_2_a5
ER  - 
%0 Journal Article
%A V. V. Baranov
%T Numerical methods of successive elimination and optimization in stochastic optimal control
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1992
%P 247-260
%V 32
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_2_a5/
%G ru
%F ZVMMF_1992_32_2_a5
V. V. Baranov. Numerical methods of successive elimination and optimization in stochastic optimal control. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 2, pp. 247-260. http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_2_a5/

[1] Bertsekas D., Shriv S., Stokhasticheskoe optimalnoe upravlenie, Nauka, M., 1985 | MR | Zbl

[2] Khovard R., Dinamicheskoe programmirovanie i markovskie protsessy, Sov. radio, M., 1964 | MR

[3] Blackwell D., “Discrete dynamic programming”, Ann. Math. Statist., 33 (1962), 719–726 | DOI | MR | Zbl

[4] Derman C., “On sequential decision and Markov chains”, Management Sci., 9 (1962), 451–462 | DOI | MR

[5] White D., “Dynamic programming, Markov chains, and the method of successive approximation”, J. Math. Analys. and Appl., 6 (1963), 373–376 | DOI | MR | Zbl

[6] Veinott Jr., “On the finding optimal policies in discrete dynamic programming with no discounting”, Ann. Math. Statist., 37 (1966), 1284–1294 | DOI | MR | Zbl

[7] Derman C., Finite state Markovian decision processes, Acad. Press, N. Y., 1970 | MR | Zbl

[8] Main Kh., Osaki S., Markovskie protsessy prinyatiya reshenii, Nauka, M., 1977 | MR | Zbl

[9] Dynkin E. B., Yushkevich A. A., Upravlyaemye markovskie protsessy, Nauka, M., 1975 | MR

[10] Baranov V. V., “Optimizatsionnye metody posledovatelnykh priblizhenii v markovskikh protsessakh reshenii”, Kibernetika, 1985, no. 3, 103–111 | MR | Zbl

[11] Baranov V. V., “Vychislitelnye metody optimalnogo stokhasticheskogo upravleniya. Printsip optimalnosti i optimizatsionnaya skhema posledovatelnykh priblizhenii”, Zh. vychisl. matem. i matem. fiz., 31:5 (1991), 663–680 | MR