2025/09/01 by Kai Du, Qingmeng Wei, Du, Kai +1
Computer Science · Engineering · #Adaptive Dynamic Programming Control #Extremum Seeking Control Systems #Optimization and Variational Analysis #math.OC
paper · pdf · doi:10.48550/arxiv.2509.01054
openalex publication_date 2025/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate an optimal control problem for a diffusion whose drift and running cost are merely measurable in the state variable. Such low regularity rules out the use of Pontryagin's maximum principle and also invalidates the standard proof of the Bellman principle of optimality. We address these difficulties by analyzing the associated Hamilton-Jacobi-Bellman (HJB) equation. Working in a weak formulation of admissible controls, we first establish the state-equation solvability and Krylov estimates needed to make the control problem well defined. Using PDE techniques together with a policy iteration scheme, we prove that the HJB equation admits a unique strong solution, and this solution coincides with the value function of the control problem. Based on this identification, we establish a verification theorem and recover the Bellman optimality principle without imposing any additional smoothness assumptions. We further investigate a mollification scheme depending on a parameter ε > 0. It turns out that the smoothed value functions Vε may fail to converge to the original value function V as ε → 0, and we provide an explicit counterexample. To resolve this, we identify a structural condition on the control set. When the control set is countable, convergence Vε → V holds locally uniformly.