No label defined (Q3331809)
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 3863956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3863956 |
Statements
1984
0 references
value functions
0 references
finite dimensional parametrization
0 references
0.7767832279205322
0 references
0.763992190361023
0 references
0.7440316081047058
0 references
0.7314151525497437
0 references
0.7291407585144043
0 references
[For the entire collection see Zbl 0538.00033.] A wellknown phenomenon in dynamic programming is the so called ''curse of dimensionality''. Essentially it says that the computational effort in dynamic programming grows exponentially with the dimension of the state space. In some instances it is possible to circumvent this curse. One such case is the quadratic one, i.e. when the involved cost functions are quadratic. Then the value functions happen to be quadratic and the recursion may be done in terms of the parameters of the quadratic functions. In this paper we will survey some results on when such a finite dimensional parametrization of the value functions is possible.
0 references