Calculus of variations and optimal control; optimization Dynamic programming and Hamilton-Jacobi theory Concept
Value function
Summary
The value function of an optimal control problem gives the optimal cost as a function of the initial time and the initial state. It is the central object of dynamic programming: it satisfies the Hamilton–Jacobi–Bellman equation, in the viscosity sense when it is not smooth. Its gradient, where it exists, is the costate of Pontryagin's maximum principle up to sign. In economics the same notion appears as the indirect utility or the optimal value of a maximization problem.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | K6G0DRQ3CP |
|---|---|
| URI | m2://K6G0DRQ3CP |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49L20, 49L12, 93E20 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Definitions
Used by
- Dynamic programming in continuous time
- Viscosity solution of the Hamilton–Jacobi–Bellman equation
- Verification theorem