Algorithms for Solving Dynamic Models with Occasionally Binding Constraints
|
NBER Technical Working Paper No. 218
Issued in October 1997
NBER Program(s): EFG
We describe and compare several algorithms for approximating the solution to a model in" which inequality constraints occasionally bind. Their performance is evaluated and compared" using various parameterizations of the one sector growth model with irreversible investment. We" develop parameterized expectation algorithms which, on the basis of speed convenience of implementation, appear to dominate the other algorithms."
Published: Christiano, Lawrence J. and Jonas D.M. Fisher. "Algorithms For Solving Dynamic Models With Occasionally Binding Constraints," Journal of Economic Dynamics and Control, 2000, v24(8,Jul), 1179-1232.
This paper is not currently available on-line.
No more information is available.
Machine-readable bibliographic record -
MARC,
RIS,
BibTeX
|
|
|
About
Support
The research activities of the NBER are funded by grants from federal research agencies, by private foundations, and by generous donations from our corporate associates and from private individuals. The NBER is a non-profit, 501(c)(3) organization. For information on supporting the NBER, please contact:
Mr. Denis Healy, Director of Development
NBER
1050 Massachusetts Avenue
Cambridge, MA 02138-5398
ph: 617-868-3900
email: dhealy@nber.org
Close
