Algorithms for solving dynamic models with occasionally binding constraints (Q1575282)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms for solving dynamic models with occasionally binding constraints
scientific article

    Statements

    Algorithms for solving dynamic models with occasionally binding constraints (English)
    0 references
    21 August 2000
    0 references
    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.
    0 references
    dynamic models
    0 references
    parameterized expectation algorithms
    0 references
    speed
    0 references
    accuracy
    0 references
    convenience
    0 references

    Identifiers