Local minimization algorithms for dynamic programming equations

Abstract : 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 l1-penalization which lead to sparse controls.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01120450
Contributor : Axel Kröner <>
Submitted on : Wednesday, February 25, 2015 - 4:28:21 PM
Last modification on : Monday, September 30, 2019 - 10:46:02 AM
Long-term archiving on : Tuesday, May 26, 2015 - 1:55:20 PM

File

KaliseKroenerKunisch2015.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01120450, version 1

Citation

Dante Kalise, Axel Kröner, Karl Kunisch. Local minimization algorithms for dynamic programming equations . SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2016, 38 (3). ⟨hal-01120450⟩

Share

Metrics

Record views

848

Files downloads

299