A 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 approximate value functions. Our numerical results show that this nonlinear programming is efficient and accurate, and avoids inefficient discretization.
A significance statement is not available in the OpenAlex record.
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 approximate value functions. Our numerical results show that this nonlinear programming is efficient and accurate, and avoids inefficient discretization.
Key concepts: Discretization, Nonlinear programming, Dynamic programming, Nonlinear system, Mathematical optimization, Computer science, Reactive programming, Fractional programming