# Value function

The value function of an optimization problem gives the value attained by the objective function at a solution, while only depending on the parameters of the problem.[1][2] In a controlled dynamical system, the value function represents the optimal payoff of the system over the interval [t, T] when started at the time-t state variable x(t)=x.[3] If the objective function represents some cost that is to be minimized, the value function can be interpreted as the cost to finish the optimal program, and is thus referred to as "cost-to-go function."[4] In an economic context, where the objective function usually represents utility, the value function is conceptually equivalent to the indirect utility function.[5][6]

In a problem of optimal control, the value function is defined as the supremum of the objective function taken over the set of admissible controls. Given ${\displaystyle (t_{0},x_{0})\in [0,t_{1}]\times \mathbb {R} ^{d}}$, a typical optimal control problem is

${\displaystyle {\text{maximize}}\quad J(t_{0},x_{0};u)=\int _{t_{0}}^{t_{1}}I(t,x(t),u(t))\,\mathrm {d} t+\phi (x(t_{1}))}$

subject to

${\displaystyle {\frac {\mathrm {d} x(t)}{\mathrm {d} t}}=f(t,x(t),u(t))}$

with initial state variable ${\displaystyle x(t_{0})=x_{0}}$.[7] The objective function ${\displaystyle J(t_{0},x_{0};u)}$ is to be maximized over all admissible controls ${\displaystyle u\in U[t_{0},t_{1}]}$, where ${\displaystyle u}$ is a Lebesgue measurable function from ${\displaystyle [t_{0},t_{1}]}$ to some prescribed arbitrary set in ${\displaystyle \mathbb {R} ^{m}}$. The value function is then defined as

${\displaystyle V(t_{0},x_{0})=\sup _{u\in U}J(t_{0},x_{0};u)}$

If the optimal pair of control and state trajectories is ${\displaystyle (x^{\ast },u^{\ast })}$, then ${\displaystyle V(t_{0},x_{0})=J(t_{0},x_{0};u^{\ast })}$. In economics, the function ${\displaystyle u^{\ast }=h(x)}$ is called a policy function.[8]

Bellman's principle of optimality roughly states that any optimal policy at time ${\displaystyle t}$, ${\displaystyle t_{0}\leq t\leq t_{1}}$ taking the current state ${\displaystyle x(t)}$ as "new" initial condition must be optimal for the remaining problem. If the value function happens to be continuously differentiable,[9] this gives rise to an important functional recurrence equation known as Hamilton–Jacobi–Bellman equation,

${\displaystyle -{\frac {\partial V(t,x)}{\partial t}}=\max _{u}H\left(t,x,u,{\frac {\partial V(t,x)}{\partial x}}\right)}$

where the maximand on the right-hand side is the Hamiltonian, with ${\displaystyle \partial V(t,x)/\partial x}$ playing the role of the costate variables.[10] The value function is a viscosity solution to the Hamilton–Jacobi–Bellman equation.[11]

In an online closed-loop approximate optimal control, the value function is also a Lyapunov function that establishes global asymptotic stability of the closed-loop system.[12]

## References

1. ^ Fleming, Wendell H.; Rishel, Raymond W. (1975). Deterministic and Stochastic Optimal Control. Berlin: Springer. pp. 81–83.
2. ^ Caputo, Michael R. (2005). Foundations of Dynamic Economic Analysis : Optimal Control Theory and Applications. New York: Cambridge University Press. p. 185. ISBN 0-521-60368-4.
3. ^ Weber, Thomas A. (2011). Optimal Control Theory : with Applications in Economics. Cambridge: The MIT Press. p. 82. ISBN 978-0-262-01573-8.
4. ^ "EE365: Dynamic Programming" (PDF).
5. ^ Mas-Colell, Andreu; Whinston, Michael D.; Green, Jerry R. (1995). Microeconomic Theory. New York: Oxford University Press. p. 964. ISBN 0-19-507340-1.
6. ^ Corbae, Dean; Stinchcombe, Maxwell B.; Zeman, Juraj (2009). An Introduction to Mathematical Analysis for Economic Theory and Econometrics. Princeton University Press. p. 145. ISBN 978-0-691-11867-3.
7. ^ Kamien, Morton I.; Schwartz, Nancy L. (1991). Dynamic Optimization : The Calculus of Variations and Optimal Control in Economics and Management (2nd ed.). Amsterdam: North-Holland. p. 259. ISBN 0-444-01609-0.
8. ^ Ljungqvist, Lars; Sargent, Thomas J. (2018). Recursive Macroeconomic Theory (Fourth ed.). Cambridge: MIT Press. p. 106. ISBN 978-0-262-03866-9.
9. ^ Benveniste and Scheinkman established sufficient conditions for the differentiability of the value function, which in turn allows the application of the envelope theorem, see Benveniste, L. M.; Scheinkman, J. A. (1979). "On the Differentiability of the Value Function in Dynamic Models of Economics". Econometrica. 47 (3): 727–732. JSTOR 1910417. Also see Seierstad, Atle (1982). "Differentiability Properties of the Optimal Value Function in Control Theory". Journal of Economic Dynamics and Control. 4: 303–310. doi:10.1016/0165-1889(82)90019-7.
10. ^ Kirk, Donald E. (1970). Optimal Control Theory. Englewood Cliffs, NJ: Prentice-Hall. p. 88. ISBN 0-13-638098-0.
11. ^ Zhou, X. Y. (1990). "Maximum Principle, Dynamic Programming, and their Connection in Deterministic Control". Journal of Optimization Theory and Applications. 65 (2): 363–373. doi:10.1007/BF01102352.
12. ^ Kamalapurkar, Rushikesh; Walters, Patrick; Rosenfeld, Joel; Dixon, Warren (2018). "Optimal Control and Lyapunov Stability". Reinforcement Learning for Optimal Feedback Control: A Lyapunov-Based Approach. Berlin: Springer. pp. 26–27. ISBN 978-3-319-78383-3.