Implicit Programming and the Stable Manifold for Optimal Growth Problems
Baoline Chen and
No 254, Computing in Economics and Finance 1999 from Society for Computational Economics
The stable manifold for the discrete-time, one-sector optimal growth model is shown to be constructed by solving a functional equation for an implicit programming problem based on the planner's Euler equation. The implicit programming problem is described by a minimum-gain operator, and its unique fixed-point solution is the optimal policy function. This operator was introduced by Becker and Foias (1998). The term "implicit programming" comes from the observation that the unknown optimal policy function appears in the constraints of the optimization problem as well as in the problem's value function. The implicit programming problem defines an algorithm for computing the optimal policy function. The proposed paper numerically illustrates convergence of the algorithm -- in particular, that its iterates converge to the optimal policy function. We apply the algorithm to several different economic growth models. To assess the efficiency and accuracy of the algorithm, we also solve the example models with alternative methods, such as projection and perturbation methods.
References: Add references at CitEc
Citations: Track citations by RSS feed
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf9:254
Access Statistics for this paper
More papers in Computing in Economics and Finance 1999 from Society for Computational Economics CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F. Baum ().