Metraipolis › archive › dc_6817e14df2dd

A Primal Perspective on Distributionally Robust Optimization: An Investigation on Modeling and Solution Strategies — arXiv:2608.04123

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04123
License (as archived)
CC0-1.0
Archived
2026-10-31T11:37:53.984Z
SHA-256 of the archived text
e58101acbbae00041a2e4d129bc5e46b5f86a1790c42110a72b471cf3bc6114a
Stable URL of this page
https://metraipolis.com/documento/dc_6817e14df2dd

How to cite

A Primal Perspective on Distributionally Robust Optimization: An Investigation on Modeling and Solution Strategies — arXiv:2608.04123 — arXiv (en), https://arxiv.org/abs/2608.04123 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6817e14df2dd (Metraipolis archive dc_6817e14df2dd, sha256 e58101acbbae00041a2e4d129bc5e46b5f86a1790c42110a72b471cf3bc6114a)
BibTeX
@misc{dc6817e14df2dd,
  title = {A Primal Perspective on Distributionally Robust Optimization: An Investigation on Modeling and Solution Strategies — arXiv:2608.04123},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04123},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6817e14df2dd; sha256 e58101acbbae00041a2e4d129bc5e46b5f86a1790c42110a72b471cf3bc6114a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04123. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

As a popular optimization scheme, distributionally robust optimization (DRO) protects decisions against ambiguity in probability distributions. For (single-stage) DRO, prevailing dual reformulations can become difficult when model or ambiguity-set structures are complex. We study DRO from a primal perspective, working directly with distributions in ambiguity sets on closed, potentially unbounded sample spaces. This perspective leads to an algorithmic framework, referred to as BiCS, that constructs and leverages distribution cuts to achieve strong performance. We show that BiCS is applicable to standard DRO, almost-sure DRO, DRO with various chance constraints, and DRO with ambiguity sets strengthened by local information. Numerical experiments with moment and Wasserstein ambiguity sets show that this framework demonstrates superior performance, including solving cases where the examined compact reformulations are unavailable or computationally difficult. The local-information study also makes changes in worst-case distributions directly visible.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.OC).
Categorie arXiv: Optimization and Control (math.OC) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2608.04123 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:28:34.322Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).