Shape‐preserving dynamic programming

Shape‐preserving dynamic programming

0.00 Avg rating0 Votes
Article ID: iaor20133812
Volume: 77
Issue: 3
Start Page Number: 407
End Page Number: 421
Publication Date: Jun 2013
Journal: Mathematical Methods of Operations Research
Authors: ,
Keywords: economics
Abstract:

Dynamic programming is the essential tool in dynamic economic analysis. Problems such as portfolio allocation for individuals and optimal growth of national economies are typical examples. Numerical methods typically approximate the value function and use value function iteration to compute the value function for the optimal policy. Polynomial approximations are natural choices for approximating value functions when we know that the true value function is smooth. However, numerical value function iteration with polynomial approximations is unstable because standard methods such as interpolation and least squares fitting do not preserve shape. We introduce shape‐preserving approximation methods that stabilize value function iteration, and are generally faster than previous stable methods such as piecewise linear interpolation.

Reviews

Required fields are marked *. Your email address will not be published.