Nonlinear Programming Method for Dynamic Programming
21 Pages Posted: 11 May 2013 Last revised: 6 Jul 2023
Date Written: May 2013
Abstract
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.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Estimating Dynamic Models of Imperfect Competition
By Patrick Bajari, C. Lanier Benkard, ...
-
Estimating Dynamic Models of Imperfect Competition
By Patrick Bajari, C. Lanier Benkard, ...
-
Sequential Estimation of Dynamic Discrete Games
By Victor Aguirregabiria and Pedro Mira
-
By Ariel Pakes and Paul Mcguire
-
Simple Estimators for the Parameters of Discrete Dynamic Games (with Entry/Exit Examples)
By Ariel Pakes, Michael Ostrovsky, ...
-
Simple Estimators for the Parameters of Discrete Dynamic Games (with Entry/Exit Samples)
By Ariel Pakes, Michael Ostrovsky, ...
-
A Dynamic Analysis of the Market for Wide-Bodied Commercial Aircraft
-
Multiple Equilibria and Deterrence in Airline Markets
By Federico Ciliberto and Zhou Zhang
-
Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity
-
Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity