|
Home
News
Citegeist
|
Browse Groups
Search Groups
Journals
|
FAQs
Howto
Discussion
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Algorithms for solving dynamic models with occasionally binding constraints |
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting HistoryNEW
AbstractWe 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.
BibTeX record
RIS record