A column-generation-based C&CG algorithm from the primal perspective solves two-stage DRO exactly and empirically much faster, including problems with infeasible recourse and non-convex ambiguity sets.
A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present a general duality result for Wasserstein distributionally robust optimization that holds for any Kantorovich transport cost, measurable loss function, and nominal probability distribution. Assuming an interchangeability principle inherent in existing duality results, our proof only uses one-dimensional convex analysis. Furthermore, we demonstrate that the interchangeability principle holds if and only if certain measurable projection and weak measurable selection conditions are satisfied. To illustrate the broader applicability of our approach, we provide a rigorous treatment of duality results in distributionally robust Markov decision processes and distributionally robust multistage stochastic programming. Additionally, we extend our analysis to other problems such as infinity-Wasserstein distributionally robust optimization, risk-averse optimization, and globalized distributionally robust counterpart.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Two-Stage Distributionally Robust Optimization: Intuitive Understanding and Algorithm Development from the Primal Perspective
A column-generation-based C&CG algorithm from the primal perspective solves two-stage DRO exactly and empirically much faster, including problems with infeasible recourse and non-convex ambiguity sets.