Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.
(a) Case 1: the constraintα n+1 ≤0 is tight, i.e.,α n+1 = 0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generalized Dual Decomposition
Generalized Dual Decomposition replaces linear regularizers with nonlinear ones in dual decomposition to achieve strong duality and global optimality for mixed-integer two-stage stochastic programs while retaining parallelization.