Rake-compress tree contraction yields an algebraically exact, O(log N) span factorization and solve for dual-regularized LQR on arbitrary scenario trees.
Temporal parallelization of dynamic programming and linear quadratic control,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Rake-Compress Riccati Recursions for Parallel Scenario-Tree Model Predictive Control
Rake-compress tree contraction yields an algebraically exact, O(log N) span factorization and solve for dual-regularized LQR on arbitrary scenario trees.