Geodesic
Some questions of the structure of the programmed iterations method
Fundamentalʹnaâ i prikladnaâ matematika, Tome 8 (2002) no. 3, pp. 921-942.

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

Two abstract versions of the programmed iterations method are considered. This method was used in the theory of differential games for constructing the value function and the stable bridges in the sense of N. N. Krasovskii. The connection of the direct version of the programmed iterations method and the known iterated procedure operating in the space of sets is investigated. The direct iterated procedure is realized in the space of set-valued mappings. For the indirect iterated procedure the natural process of the compression of phase constraints is realized; the corresponding goal set is fixed. The duality of two above-mentioned versions of the programmed iterations method is established. 
@article{FPM_2002_8_3_a16,
     author = {A. G. Chentsov},
     title = {Some questions of the structure of the programmed iterations method},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {921--942},
     publisher = {mathdoc},
     volume = {8},
     number = {3},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2002_8_3_a16/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - Some questions of the structure of the programmed iterations method
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2002
SP  - 921
EP  - 942
VL  - 8
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2002_8_3_a16/
LA  - ru
ID  - FPM_2002_8_3_a16
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T Some questions of the structure of the programmed iterations method
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2002
%P 921-942
%V 8
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2002_8_3_a16/
%G ru
%F FPM_2002_8_3_a16
A. G. Chentsov. Some questions of the structure of the programmed iterations method. Fundamentalʹnaâ i prikladnaâ matematika, Tome 8 (2002) no. 3, pp. 921-942. http://geodesic.mathdoc.fr/item/FPM_2002_8_3_a16/

[1] Aizeks R., Differentsialnye igry, Mir, M., 1967 | MR

[2] Krasovskii N. N., Igrovye zadachi o vstreche dvizhenii, Nauka, M., 1970 | MR

[3] Krasovskii N. N., Subbotin A. I., Pozitsionnye differentsialnye igry, Nauka, M., 1974 | MR | Zbl

[4] Krasovskii N. N., Upravlenie dinamicheskoi sistemoi. Zadacha o minimume garantirovannogo rezultata, Nauka, M., 1985 | MR

[5] Subbotin A. I., Chentsov A. G., Optimizatsiya garantii v zadachakh upravleniya, Nauka, M., 1981 | MR

[6] Subbotin A. I., Minimaksnye neravenstva i uravneniya Gamiltona–Yakobi, Nauka, M., 1991 | MR

[7] Chentsov A. G., “O strukture odnoi igrovoi zadachi sblizheniya”, DAN SSSR, 224:6 (1975), 1272–1275 | MR | Zbl

[8] Chentsov A. G., “K igrovoi zadache navedeniya”, DAN SSSR, 226:1 (1976), 73–76 | MR | Zbl

[9] Chentsov A. G., “K igrovoi zadache navedeniya s informatsionnoi pamyatyu”, DAN SSSR, 227:2 (1976), 306–308 | MR | Zbl

[10] Chentsov A. G., “Ob igrovoi zadache sblizheniya v zadannyi moment vremeni”, Mat. sbornik, 99:3 (1976), 394–420 | MR | Zbl

[11] Chistyakov S. V., “K resheniyu igrovykh zadach presledovaniya”, Prikladnaya matematika i mekhanika, 41:5 (1977), 825–832 | MR | Zbl

[12] Chentsov A. G., “Ob igrovoi zadache navedeniya k zadannomu momentu vremeni”, Izv. AN SSSR. Ser. matem., 42:2 (1978), 455–467 | MR | Zbl

[13] Chentsov A. G., “Iteratsionnaya programmnaya konstruktsiya dlya differentsialnoi igry s fiksirovannym momentom okonchaniya”, DAN SSSR, 240:1 (1978) | MR | Zbl

[14] Chentsov A. G., Metod programmnykh iteratsii dlya differentsialnoi igry sblizheniya-ukloneniya, Dep. v VINITI No 1933-79Dep, 1979

[15] Dyatlov V. P., Chentsov A. G., “Monotonnye iteratsii mnozhestv i ikh prilozheniya k igrovym zadacham upravleniya”, Kibernetika, 1987, no. 2, 92–99 | MR | Zbl

[16] Subbotin A. I., Chentsov A. G., “Iteratsionnaya protsedura dlya postroeniya minimaksnykh i vyazkostnykh reshenii uravnenii Gamiltona–Yakobi”, Dokl. RAN, 348:6 (1996), 736–739 | MR | Zbl

[17] Subbotin A. I., Chentsov A. G., “Iteratsionnaya protsedura postroeniya minimaksnykh i vyazkostnykh reshenii uravnenii Gamiltona–Yakobi i ee obobscheniya”, Trudy MIAN, 224, 1999, 311–334 | MR | Zbl

[18] Subbotin A. I., “Minimaksnye resheniya uravneniya s chastnymi proizvodnymi pervogo poryadka”, Uspekhi mat. nauk, 51:2 (1996), 105–138 | MR | Zbl

[19] Subbotin A. I., Generalized solutions of first order PDE: The dynamical optimization perspective, Birkhauser, Boston, 1995 | MR

[20] Chentsov A. G., “Metod programmnykh iteratsii v klasse konechno-additivnykh upravlenii-mer”, Differents. uravn, 1997, no. 11, 1528–1536 | MR | Zbl

[21] Chentsov A. G., “Iteratsionnaya realizatsiya neuprezhdayuschikh mnogoznachnykh otobrazhenii”, Dokl. RAN, 357:5 (1997), 595–598 | MR | Zbl

[22] Chentsov A. G., “K voprosu o parallelnoi versii abstraktnogo analoga metoda programmnykh iteratsii”, Dokl. RAN, 362:5 (1998), 602–605 | MR | Zbl

[23] Roxin E., “Axiomatic approach in differential games”, J. Optimiz. Theory and Appl., 3:3 (1969), 153–163 | DOI | MR | Zbl

[24] Elliott R. J., Kalton N. J., “The existence of value in differential games”, Memoirs of the Amer. Math. Soc., 126, 1972 | MR | Zbl

[25] Kelli Dzh. L., Obschaya topologiya, Nauka, M., 1981 | MR

[26] Engelking R., Obschaya topologiya, Mir, M., 1986 | MR

[27] Saint-Pierre P., “Approximation of the viability kernel”, Appl. Math. Optim., 29 (1992), 187–209 | DOI | MR

[28] Cardaliaguet P., Quincampoix M., Saint-Piarre P., “Some algorithms for differential games with two players and one target”, Cahiers de Mathematiques de la Decision, 1993, no. 9343

[29] Varga Dzh., Optimalnoe upravlenie differentsialnymi i funktsionalnymi uravneniyami, Nauka, M., 1977 | MR

[30] Dedonne Zh., Osnovy sovremennogo analiza, Mir, M., 1964

[31] Neve Zh., Matematicheskie osnovy teorii veroyatnostei, Mir, M., 1969 | MR | Zbl

[32] Edvards R., Funktsionalnyi analiz, Mir, M., 1969