Successive approximations of Bellman's function

MaRDI QIDQ1107099zbMATH OpenFDO

Authors V. A. Gerasimov

Publication date 1987

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

algorithmsuccessive approximationBellman functiondiscrete-time control problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Dynamic programming (90C39) Numerical methods based on nonlinear programming (49M37) Dynamic programming in optimal control and differential games (49L20) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)

Recommendations

• scientific article; zbMATH DE number 3945922
• scientific article; zbMATH DE number 4116329
• A successive approximation algorithm for stochastic control problems
• scientific article; zbMATH DE number 4187029
• scientific article; zbMATH DE number 3951413

Cited in

(5)

• To the Bellman-Johnson problem
• scientific article; zbMATH DE number 3945922 (Why is no real title available?)
• scientific article; zbMATH DE number 3847201 (Why is no real title available?)
• Approximate algorithms for the traveling salesman problem. II
• Extending Bell numbers for parsimonious chase estimation

This page was built for publication: Successive approximations of Bellman's function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107099)