A discrete approximate iteration method for the continuing convex dynamic programming

MaRDI QIDQ2917062zbMATH OpenFDO

Authors Peng Zhang

Publication date 5 October 2012

Published in Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

max-plus algebradiscrete approximate iteration methodpivoting algorithmconvex dynamic programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Recommendations

• A new algorithm for multidimensional continuing dynamic programming
• A new algorithm for the continuous dynamic programming
• A convex optimization approach to dynamic programming in continuous state and action spaces
• The Parameter Iteration Method in Dynamic Programming
• Discrete approximation of a problem of continuous programming

Cited in

(4)

• A new algorithm for the continuous dynamic programming
• A new algorithm for multidimensional continuing dynamic programming
• A convex optimization approach to dynamic programming in continuous state and action spaces
• The Parameter Iteration Method in Dynamic Programming

This page was built for publication: A discrete approximate iteration method for the continuing convex dynamic programming

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