Algorithms for Solving Dynamic Models with Occasionally Binding Constraints

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