Approximate dynamic programming via iterated Bellman inequalities (Q5256802)
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 6452312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate dynamic programming via iterated Bellman inequalities |
scientific article; zbMATH DE number 6452312 |
Statements
Approximate dynamic programming via iterated Bellman inequalities (English)
0 references
29 June 2015
0 references
convex optimization
0 references
dynamic programming
0 references
stochastic control
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7933618426322937
0 references
0.7747973203659058
0 references
0.7743399143218994
0 references
0.773464560508728
0 references
0.7730271220207214
0 references
