×
Iwamoto, Seiichi

Inverse theorem in dynamic programming. II. (English) Zbl 0445.49031

J. Math. Anal. Appl. 58, 249-279 (1977).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0445.49031

Cited in 1 Review
Cited in 17 Documents

MSC:

49L20 Dynamic programming in optimal control and differential games
90C39 Dynamic programming

Keywords:

inverse theorem
Cite Review PDF
Full Text: DOI

References:

[1] Bellman, R., Dynamic Programming (1957), Princeton Univ. Press: Princeton Univ. Press Princeton, N.J · Zbl 0077.13605
[2] Bellman, R.; Dreyfus, S. E., Applied Dynamic Pogramming (1962), Princeton Univ. Press: Princeton Univ. Press Princeton, N.J · Zbl 0106.34901
[3] Bellman, R.; Kalaba, R., Dynamic Programming and Modern Control Theory (1965), Academic Press: Academic Press New York and London · Zbl 0156.16902
[4] Furukawa, N.; Iwamoto, S., Dynamic programming on recursive reward systems, Bull. Math. Statist., 17, 103-126 (1976) · Zbl 0378.49021
[5] Hogan, W. W., Point-to-set maps in mathematical programming, SIAM Rev., 15, 591-603 (1973) · Zbl 0256.90042
[6] Iwamoto, S., Finite horizon Markov games with recursive payoff systems, Mem. Fac. Sci. Kyushu Univ. Ser. A, 29, 123-147 (1975) · Zbl 0351.90088
[7] Iwamoto, S., Applications of Recursive Dynamic Programming (1975), preprint (in Japanese)
[8] Iwamoto, S., Inverse theorem in dynamic programming I, J. Math. Anal. Appl., 58, 113-134 (1977) · Zbl 0445.49030
[9] Mitten, L. G., Composition principles for synthesis of optimal multistage processes, Operations Res., 12, 610-619 (1964) · Zbl 0127.36502
[10] Memhauser, G. L., Introduction to Dynamic Programming (1966), Wiley: Wiley New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.