OS-CMDP uses Douglas-Rachford splitting to solve convex-constrained MDPs by alternating between a quadratically regularized MDP update and a projection onto the constraint set, with convergence and infeasibility-detection guarantees.
Policy-based primal-dual methods for convex constrained Markov decision processes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Operator Splitting for Convex Constrained Markov Decision Processes
OS-CMDP uses Douglas-Rachford splitting to solve convex-constrained MDPs by alternating between a quadratically regularized MDP update and a projection onto the constraint set, with convergence and infeasibility-detection guarantees.