Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 14 min ago
PreprintCC BY 4.0arXiv

Bellman semigroups. Quarante ans d'après

Abstract

We revisit the relation between discrete- and continuous-time stationary dynamic optimization, using both the Bellman and Hamiltonian descriptions. We study the problem of embedding discrete Bellman--Lax--Oleinik operators and the associated Hamiltonian cascades into continuous-time dynamics. Rather subtle obstructions to such embeddings emerge even under the most natural assumptions.

Related

  1. Policy iteration for Hamilton-Jacobi-Isaacs equations with control constraints and comparison with Hamilton-Jacobi-Bellman equations
    Sudeep Kundu, Karl Kunisch
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingOptimisation & controlarXiv
  2. Bellman's Forest Problem and Computability
    Jacob Canel
    arXivPreprintCC BY 4.0Full textGeometry & topologyLogic & foundationsarXiv
  3. Bellman Policy Optimization
    Zhuoqing Song, Haotian Xu, Xikun Zhang +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Comparison Principle and Semi-Lagrangian Methods for a Hamilton--Jacobi--Bellman System with Recursive Utility
    Qing Tang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingOptimisation & controlarXiv
  5. Analytical and numerical periodic homogenization of Hamilton--Jacobi--Bellman and Isaacs equations in a W2,p Cordes framework
    Timo Sprekeler, Hung V. Tran
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
BibTeX
@misc{yakovenko2026bellman,
  title = {{Bellman semigroups. Quarante ans d'après}},
  author = {Sergei Yakovenko},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41436},
  eprint = {2610.41436},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41436},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Bellman semigroups. Quarante ans d'après
AU  - Sergei Yakovenko
PY  - 2026
DA  - 2026/10/30
PB  - arXiv
DO  - 10.48550/arxiv.2610.41436
UR  - https://arxiv.org/abs/2610.41436
AB  - We revisit the relation between discrete- and continuous-time stationary dynamic optimization, using both the Bellman and Hamiltonian descriptions. We study the problem of embedding discrete Bellman--Lax--Oleinik operators and the associated Hamiltonian cascades into continuous-time dynamics. Rather subtle obstructions to such embeddings emerge even under the most natural assumptions.
ER  -