Verification Theorems for Hamilton-Jacobi-Bellman equations
Mauro Garavello
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.
Create a lesson
Related papers
Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
David Martínez-Rubio, Cristóbal Guzmán
The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings
David Martínez-Rubio, Brian Bullins, Cristóbal Guzmán et al.
Complexity Of Output Feedback Stabilization
Amir Ali Ahmadi, Abraar Chaudhry, Ijay Narang et al.
Convergence rate of the moment-SOS hierarchy for univariate polynomial optimization
Didier Henrion, Mohab Safey El Din
Geometry and Convergence of Quadratically Regularized Optimal Transport I
Alberto González-Sanz, Marcel Nutz
Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems
Julian Niederer, Christoph Hansknecht, Andreas Potschka et al.