Gradient bounded dynamic programming with submodular and concave extensible value functions
We consider dynamic programming problems with finite, discrete-time horizons and prohibitively high-dimensional, discrete state-spaces for direct computation of the value function from the Bellman equation. For the case that the value function of the dynamic program is concave extensible and submodu...
Главные авторы: | Lebedev, D, Goulart, P, Margellos, K |
---|---|
Формат: | Conference item |
Язык: | English |
Опубликовано: |
Elsevier
2021
|
Схожие документы
-
Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
по: Lebedev, D, и др.
Опубликовано: (2021) -
Linear programming-based submodular extensions for marginal estimation
по: Pansari, P, и др.
Опубликовано: (2019) -
Submodular Secretary Problem and Extensions
по: Zadimoghaddam, Morteza, и др.
Опубликовано: (2010) -
Optimal submodular extensions for marginal estimation
по: Pansari, P, и др.
Опубликовано: (2018) -
Which submodular functions are expressible using binary submodular functions?
по: Živný, S, и др.
Опубликовано: (2008)