DYNAMIC PROGRAMMING, SUCCESSIVE APPROXIMATIONS, AND MONOTONE CONVERGENCE
From MaRDI portal
Publication:5594968
DOI10.1073/PNAS.44.6.578zbMATH Open0198.24605OpenAlexW2022655090WikidataQ37617945 ScholiaQ37617945MaRDI QIDQ5594968FDOQ5594968
Authors: Richard Bellman
Publication date: 1958
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.44.6.578
Recommendations
Cited In (12)
- Polynomial approximation technique for dynamic optimization problems
- Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming
- Title not available (Why is that?)
- Asymptotic properties in dynamic programming
- Title not available (Why is that?)
- Dynamic programming with convexity, concavity and sparsity
- A class of nonseparable dynamic programming problems
- The Computational Implications of Variations in State Variable/State Ratios in Dynamic Programming and Total Enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
This page was built for publication: DYNAMIC PROGRAMMING, SUCCESSIVE APPROXIMATIONS, AND MONOTONE CONVERGENCE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5594968)