Math 2.0

Calculus of variations and optimal control; optimization Dynamic programming and Hamilton-Jacobi theory Concept

Hamilton–Jacobi–Bellman equation

Summary

The Hamilton–Jacobi–Bellman equation is a first-order partial differential equation for the value function of an optimal control problem. It is the continuous-time form of the principle of dynamic programming: an optimal strategy stays optimal from every later state. A solution gives the optimal cost from every starting point and, through a pointwise minimization, an optimal feedback control. In general the value function is not differentiable, and the equation is understood in the sense of viscosity solutions.

Further reading

  1. Web https://en.wikipedia.org/wiki/Hamilton–Jacobi–Bellman_equation
About this page
TagSJP9HW82VX
URIm2://SJP9HW82VX
Kindconcept
WritingW0 stub
MSC49L12, 49L20
Same as
Changed2 November 2026

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