Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_2001_12_a8,
author = {A. G. Chentsov},
title = {On the duality of various versions of the programmed iteration method},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {77--88},
publisher = {mathdoc},
number = {12},
year = {2001},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2001_12_a8/}
}
A. G. Chentsov. On the duality of various versions of the programmed iteration method. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2001), pp. 77-88. http://geodesic.mathdoc.fr/item/IVM_2001_12_a8/
[1] Krasovskii N. N., Igrovye zadachi o vstreche dvizhenii, Nauka, M., 1970, 420 pp. | MR
[2] Krasovskii N. N., Subbotin A. I., Pozitsionnye differentsialnye igry, Nauka, M., 1974, 456 pp. | MR | Zbl
[3] Krasovskii N. N., Upravlenie dinamicheskoi sistemoi. Zadacha o minimume garantirovannogo rezultata, Nauka, M., 1985, 518 pp. | MR
[4] Subbotin A. I., Minimaksnye neravenstva i uravneniya Gamiltona–Yakobi, Nauka, M., 1991, 215 pp. | MR
[5] Subbotin A. I., Chentsov A. G., Optimizatsiya garantii v zadachakh upravleniya, Nauka, M., 1981, 287 pp. | MR
[6] Aizeks R., Differentsialnye igry, Mir, M., 1967, 479 pp. | 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”, Matem. sb., 99:3 (1976), 394–420 | MR | Zbl
[11] Chistyakov S. V., “K resheniyu igrovykh zadach presledovaniya”, PMM, 41:5 (1977), 825–832 | MR | Zbl
[12] Chentsov A. G., Metod programmnykh iteratsii dlya differentsialnoi igry sblizheniya-ukloneniya, Dep. v VINITI, No 1933-79, In-t matem. i mekh. UNTs AN SSSR, 1979, 102 pp.
[13] Chentsov A. G., “Ob igrovoi zadache navedeniya k zadannomu momentu vremeni”, Izv. AN SSSR. Ser. matem., 42:2 (1978), 455–467 | MR | Zbl
[14] Chentsov A. G., “Iteratsionnaya programmnaya konstruktsiya dlya differentsialnoi igry s fiksirovannym momentom okonchaniya”, DAN SSSR, 240:1 (1978), 36–39 | MR | Zbl
[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] Saint-Pierre P., “Approximation of the viability kernel”, Appl. math. optim., 29 (1992), 187–209 | DOI | MR
[17] Cardaliaguet P., Quincampoix M., Saint-Piarre P., Some algorithms for differential games with two players and one target, Cahiers de math. de la decision, 9343, 1993, 19 pp.
[18] 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
[19] Subbotin A. I., Chentsov A. G., “Iteratsionnaya protsedura postroeniya minimaksnykh i vyazkostnykh reshenii uravnenii Gamiltona–Yakobi i ee obobscheniya”, Tr. MIAN, 224, 1999, 311–334 | MR | Zbl
[20] Chentsov A. G., “Metod programmnykh iteratsii v klasse konechno-additivnykh upravlenii-mer”, Differents. uravneniya, 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] Chentsov A. G., “K voprosu ob iteratsionnoi realizatsii neuprezhdayuschikh mnogoznachnykh otobrazhenii”, Izv. vuzov. Matematika, 2000, no. 3, 66–76 | MR | Zbl
[24] Edvards R., Funktsionalnyi analiz. Teoriya i prilozheniya, Mir, M., 1969, 1071 pp.
[25] Kelli Dzh. L., Obschaya topologiya, Nauka, M., 1981, 433 pp. | MR
[26] Aleksandryan R. A., Mirzakhanyan E. A., Obschaya topologiya, Ucheb. posobie, Vyssh. shkola, M., 1979, 336 pp. | Zbl
[27] Engelking R., Obschaya topologiya, Mir, M., 1986, 751 pp. | MR
[28] Varga Dzh., Optimalnoe upravlenie differentsialnymi i funktsionalnymi uravneniyami, Nauka, M., 1977, 624 pp. | MR
[29] Gamkrelidze R. V., Osnovy optimalnogo upravleniya, Izd-vo Tbilissk. un-ta, Tbilisi, 1975, 229 pp. | MR
[30] Chentsov A. G., Finitely additive measures and relaxations of extremal problems, Plenum Publishing Corporation, New York–London–Moscow, 1996, 244 pp. | MR | Zbl
[31] Chentsov A. G., “Nonanticipating selectors of set-valued mappings and iterated procedures”, Funct. Diff. Equat., 6:3–4 (1999), 249–274 | MR | Zbl
[32] Elliott R. J., Kalton N. J., The existence of value in differential games, Memoirs of the Amer. Math. Soc., 126, 1972, 67 pp. | MR | Zbl
[33] Krasovskii N. N., Chentsov A. G., “On the design of differential games, I”, Probl. Control and Inform. Theory, 6:5–6 (1977), 381–395 | MR
[34] Krasovskii N. N., Chentsov A. G., “On the design of differential games, II”, Probl. Control and Inform. Theory, 8:1 (1979), 3–11 | MR
[35] Roxin E., “Axiomatic approach in differential games”, J. Optimiz. Theory and Appl., 3:3 (1969), 153–163 | DOI | MR | Zbl
[36] Pontryagin L. S., Boltyanskii V. G., Gamkrelidze R. V., Mischenko E. F., Matematicheskaya teoriya optimalnykh protsessov, Nauka, M., 1976, 392 pp. | MR | Zbl
[37] Chentsov A. G., “Topologicheskii variant metoda programmnykh iteratsii v abstraktnoi zadache upravleniya”, Dokl. RAN, 376:3 (2001), 311–314 | MR | Zbl