Envelope condition method versus endogenous grid method for solving dynamic programming problems (Q2442407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6278025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Envelope condition method versus endogenous grid method for solving dynamic programming problems |
scientific article; zbMATH DE number 6278025 |
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
0.8878718018531799
0 references
0.8524532914161682
0 references
0.843666136264801
0 references
0.8384907245635986
0 references
