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.
Similar content being viewed by others
References
Bellman R (1957) Dynamic programming. Princeton University Press, Princeton
Bertsekas D (2005) Dynamic programming and optimal control, vol I. Athena Scientific, Belmont
Bertsekas D (2007) Dynamic programming and optimal control, vol II. Athena Scientific, Belmont
Birge J, Louveaux FV (1997) Introduction to stochastic programming. Springer, New York
Cai Y (2009) Dynamic programming and its application in economics and finance. PhD thesis, Stanford University
Cai Y, Judd KL (2010) Stable and efficient computational methods for dynamic programming. J Eur Econ Assoc 8(2–3): 626–634
Cai Y, Judd KL (2012) Dynamic programming with shape-preserving rational spline Hermite interpolation. Econ Lett 117(1): 161–164
Czyzyk J, Mesnier M, Moré J (1998) The NEOS Server. IEEE J Comput Sci Eng 5: 68–75
Fourer R, Gay DM, Kernighan BW (1990) Modeling language for mathematical programming. Manag Sci 36: 519–554
Gill P, Murray W, Saunders M (2005) SNOPT: an SQP algorithm for largescale constrained optimization. SIAM Rev 47(1): 99–131
Judd KL (1998) Numerical methods in economics. MIT Press, Cambridge
Judd KL, Solnick A (1994) Numerical dynamic programming with shape-preserving splines. Hoover Institution, Stanford
McCarl B et al. (2011) McCarl Expanded GAMS user guide version 23.6. http://www.gams.com/mccarl/mccarlhtml/. Accessed 6 Sept 2012
Murtagh B, Saunders M (1982) A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. Math Program Study 16: 84–117
Rust J (2008) Dynamic programming. In: Durlauf SN, Blume LE (eds) New Palgrave dictionary of economics. 2. Palgrave Macmillan, Basingstoke
Schumaker L (1983) On shape-preserving quadratic spline interpolation. SIAM J Numer Anal 20: 854–864
Wang S-P, Judd KL (2000) Solving a savings allocation problem by numerical dynamic programming with shape-preserving interpolation. Comput Oper Res 27(5): 399–408
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cai, Y., Judd, K.L. Shape-preserving dynamic programming. Math Meth Oper Res 77, 407–421 (2013). https://doi.org/10.1007/s00186-012-0406-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-012-0406-5