Algorithms for Solving Dynamic Models with Occasionally Binding Constraints
NBER Technical Working Paper No. 218
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."This paper is not currently available on-line.
No more information is available.
Document Object Identifier (DOI): 10.3386/t0218
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.
Users who downloaded this paper also downloaded* these: