A polyhedral approximation approach to concave numerical dynamic programming
This paper introduces a numerical method for solving concave continuous state dynamic programming problems which is based on a pair of polyhedral approximations of concave functions. The method is globally convergent and produces computable upper and lower bounds on the value function which can in theory be made arbitrarily tight. This is true regardless of the pattern of binding constraints, the smoothness of model primitives, and the dimensionality and rectangularity of the state space. We illustrate the method's performance using an optimal firm management problem subject to credit constraints and partial investment irreversibilities.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aubhik Khan & Julia K. Thomas, 2013.
"Credit Shocks and Aggregate Fluctuations in an Economy with Production Heterogeneity,"
Journal of Political Economy,
University of Chicago Press, vol. 121(6), pages 1055 - 1107.
- Julia K. Thomas & Aubhik Khan, 2010. "Credit Shocks and Aggregate Fluctuations in an Economy with Production Heterogeneity," 2010 Meeting Papers 801, Society for Economic Dynamics.
- Aubhik Khan & Julia K. Thomas, 2011. "Credit Shocks and Aggregate Fluctuations in an Economy with Production Heterogeneity," NBER Working Papers 17311, National Bureau of Economic Research, Inc.
- Kazuo Nishimura & John Stachurski, 2007.
"Equilibrium Storage With Multiple Commodities,"
CAMA Working Papers
2007-11, Centre for Applied Macroeconomic Analysis, Crawford School of Public Policy, The Australian National University.
- Tauchen, George, 1986. "Finite state markov-chain approximations to univariate and vector autoregressions," Economics Letters, Elsevier, vol. 20(2), pages 177-181.
- John Moore & Nobuhiro Kiyotaki, .
1995-5, Edinburgh School of Economics, University of Edinburgh.
- Kenneth L. Judd, 1998. "Numerical Methods in Economics," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262100711, June.
- Abel, Andrew B & Eberly, Janice C, 1996.
"Optimal Investment with Costly Reversibility,"
Review of Economic Studies,
Wiley Blackwell, vol. 63(4), pages 581-93, October.
- Phelan, Christopher & Townsend, Robert M, 1991.
"Computing Multi-period, Information-Constrained Optima,"
Review of Economic Studies,
Wiley Blackwell, vol. 58(5), pages 853-81, October.
- Christopher Phelan & Robert M Townsend, 2010. "Computing Multi-Period, Information Constrained Optima," Levine's Working Paper Archive 117, David K. Levine.
- Phelan, C. & Townsend, R.M., 1990. "Computing Multiperiod, Information-Constrained Optima," University of Chicago - Economics Research Center 90-13, Chicago - Economics Research Center.
- Kenneth L. Judd & Sevin Yeltekin & James Conklin, 2003. "Computing Supergame Equilibria," Econometrica, Econometric Society, vol. 71(4), pages 1239-1254, 07.
- Manuel S. Santos & Jesus Vigo-Aguiar, 1998. "Analysis of a Numerical Dynamic Programming Algorithm Applied to Economic Models," Econometrica, Econometric Society, vol. 66(2), pages 409-426, March.
- Manuel S. Santos, 2000. "Accuracy of Numerical Solutions using the Euler Equation Residuals," Econometrica, Econometric Society, vol. 68(6), pages 1377-1402, November.
- John Stachurski, 2006.
"Continuous State Dynamic Programming via Nonexpansive Approximation,"
Department of Economics - Working Papers Series
961, The University of Melbourne.
- John Stachurski, 2008. "Continuous State Dynamic Programming via Nonexpansive Approximation," Computational Economics, Society for Computational Economics, vol. 31(2), pages 141-160, March.
- John Stachurski, 2006. "Continuous State Dynamic Programming Via Nonexpansive Approximation," KIER Working Papers 618, Kyoto University, Institute of Economic Research.
When requesting a correction, please mention this item's handle: RePEc:eee:dyncon:v:37:y:2013:i:11:p:2322-2335. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.