Envelope condition method versus endogenous grid method for solving dynamic programming problems (Q2442407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Comparing solution methods for dynamic equilibrium economies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the endogenous grid method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming with shape-preserving rational spline Hermite interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of endogenous gridpoints for solving dynamic stochastic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerically stable and accurate stochastic simulation approaches for solving dynamic economic models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Merging simulation and projection approaches to solve high-dimensional problems with an application to a new Keynesian model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinear dynamic stochastic models: an algorithm computing value function by simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Envelope condition method versus endogenous grid method for solving dynamic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3630866 / rank
 
Normal rank

Latest revision as of 14:00, 7 July 2024

scientific article
Language Label Description Also known as
English
Envelope condition method versus endogenous grid method for solving dynamic programming problems
scientific article

    Statements

    Envelope condition method versus endogenous grid method for solving dynamic programming problems (English)
    0 references
    0 references
    0 references
    3 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    numerical dynamic programming
    0 references
    value function iteration
    0 references
    endogenous grid
    0 references
    envelope condition
    0 references
    curse of dimensionality
    0 references
    large scale
    0 references
    0 references