SQDP replaces affine cuts with quadratic cuts in SDDP for strongly convex multistage stochastic programs, with convergence proofs and faster runtimes in experiments on multistage and deterministic strongly convex problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Stochastic Quadratic Dynamic Programming
SQDP replaces affine cuts with quadratic cuts in SDDP for strongly convex multistage stochastic programs, with convergence proofs and faster runtimes in experiments on multistage and deterministic strongly convex problems.