Nonlinear Programming Method for Dynamic Programming
Yongyang Cai, Kenneth L. Judd, Thomas S. Lontzek, Valentina Michelangeli, Che-Lin Su
Abstract
Open-access reader
Yongyang Cai, Kenneth L. Judd, Thomas S. Lontzek, Valentina Michelangeli, Che-Lin Su
Abstract
Open-access reader
A nonlinear programming formulation is introduced to solve infinite horizon dynamic programming problems.This extends the linear approach to dynamic programming by using ideas from approximation theory to avoid inefficient discretization.Our numerical results show that this nonlinear programming method is efficient and accurate.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A nonlinear programming formulation is introduced to solve infinite horizon dynamic programming problems.This extends the linear approach to dynamic programming by using ideas from approximation theory to avoid inefficient discretization.Our numerical results show that this nonlinear programming method is efficient and accurate.
Key concepts: Nonlinear programming, Computer science, Nonlinear system, Dynamic programming, Programming language, Mathematical optimization, Algorithm, Mathematics