Metraipolis › archive › dc_e47dd2f93bdf
Policy iteration for Hamilton-Jacobi-Isaacs equations with control constraints and comparison with Hamilton-Jacobi-Bellman equations — arXiv:2609.29368
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29368
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:58:08.202Z
- SHA-256 of the archived text
9c1740311ef02e942e425da10c7284577d74a14932633c4e48a759dd5ea59a3a- Stable URL of this page
https://metraipolis.com/documento/dc_e47dd2f93bdf
How to cite
Policy iteration for Hamilton-Jacobi-Isaacs equations with control constraints and comparison with Hamilton-Jacobi-Bellman equations — arXiv:2609.29368 — arXiv (en), https://arxiv.org/abs/2609.29368 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e47dd2f93bdf (Metraipolis archive dc_e47dd2f93bdf, sha256 9c1740311ef02e942e425da10c7284577d74a14932633c4e48a759dd5ea59a3a)
BibTeX
@misc{dce47dd2f93bdf,
title = {Policy iteration for Hamilton-Jacobi-Isaacs equations with control constraints and comparison with Hamilton-Jacobi-Bellman equations — arXiv:2609.29368},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29368},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e47dd2f93bdf; sha256 9c1740311ef02e942e425da10c7284577d74a14932633c4e48a759dd5ea59a3a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29368. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Convergence of the bilevel policy iteration algorithm for the value function, satisfying the Hamilton-Jacobi-Isaacs (HJI) equation, is analyzed in the presence of control constraints. Both first and second-order HJI equations corresponding to the deterministic and stochastic systems are considered. For numerical tests, a semi-implicit upwind scheme for backward HJI PDEs is applied and a thorough comparison between the solutions to first and second-order Hamilton-Jacobi-Bellman (HJB) equations is presented for both the unconstrained and the constrained control cases. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.NA). Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.29368 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T02:27:28.573Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).