Dynamic programming, quasilinearization and the dimensionality difficulty

DOI10.1016/0022-247X(69)90051-1zbMath0181.23001MaRDI QIDQ2534843

Lee, E. Stanley

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items

Polynomial approximation technique for dynamic optimization problems, A new algorithm for solving certain variational problems

Cites Work

• An approach to reducing the high-speed memory requirement of dynamic programming
• Quasilinearization and invariant imbedding. With applications to chemical engineering and adaptive control
• Some new techniques in the dynamic programming solution of variational problems
• Unnamed Item
• Unnamed Item
• Unnamed Item