.png){kind=icon}
.png){kind=icon}
Return
LOCAL MINIMIZATION ALGORITHMS FOR DYNAMIC PROGRAMMING EQUATIONS
.png){kind=icon}
OA
AI
DOI：10.1137/15M1010269.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible controls. This minimization is often performed by comparison over a finite number of elements of the control set. In this paper we demonstrate the importance of an accurate realization of these minimization problems and propose algorithms by which this can be achieved effectively. The considered class of equations includes nonsmooth control problems with l(1)-penalization which lead to sparse controls.
Keywords:
dynamic programming
Hamilton-Jacobi-Bellman equations
semi-Lagrangian schemes
first-order primal-dual methods
semismooth Newton methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W