Negative dynamic programming with non-additively time-separable objective

DOI10.23952/COT.2025.33MaRDI QIDQ6978770zbMATH OpenFDO

Authors Luigi Montrucchio, Fabio Privileggi

Publication date 27 May 2025

Published in Communications in Optimization Theory (Search for Journal in Brave)

zbMATH Keywords

Bellman equationnegative dynamic programmingnon-additive recursive objectivestrongly concave functionals

Mathematics Subject Classification ID

Convex programming (90C25) Dynamic programming (90C39)

This page was built for publication: Negative dynamic programming with non-additively time-separable objective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6978770)