Verification Theorems for Hamilton-Jacobi-Bellman equations
Abstract
We study an optimal control problem in Bolza form and we consider the value function associated to this problem. We prove two verification theorems which ensure that, if a function W satisfies some suitable weak continuity assumptions and a Hamilton-Jacobi-Bellman inequality outside a countably Hn-rectifiable set, then it is lower or equal to the value function. These results can be used for optimal synthesis approach.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.