Envelope condition method versus endogenous grid method for solving dynamic programming problems (Q2442407): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.econlet.2013.04.031 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ECONLET.2013.04.031 / rank | |||
Normal rank | |||
Latest revision as of 16:13, 18 December 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
3 April 2014
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
0 references
0 references
0 references
