Algorithms for solving dynamic models with occasionally binding constraints

From MaRDI portal





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, accuracy and convenience of implementation, appear to dominate the other algorithms.




Cited in
(42)








This page was built for publication: Algorithms for solving dynamic models with occasionally binding constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575282)