Distributionally robust chance-constrained standard quadratic optimization with Wasserstein ambiguity
Abstract
The standard quadratic optimization problem consists of minimizing a quadratic form over the standard simplex. It has highly relevant applications ranging from portfolio optimization to machine learning. However, if the quadratic form is neither convex nor concave, this problem is NP-hard. We study a distributionally robust chance-constrained variant whose ambiguity set is a Wasserstein ball around the sampled distribution and make four contributions. First, although the problem is nonconvex in the decision variable, we exploit its linear dependence on the uncertain matrix to reduce the problem to a mixed-integer quadratic optimization problem. Second, we show that a judicious choice of matrix norm---the entrywise maximum norm---makes this reformulation both exact and tractable, and we describe the induced worst-case distribution. Third, our formulation is, by construction, the minimization of the worst-case Value-at-Risk of the random quadratic form; this unifies it with existing frameworks for uncertain standard quadratic optimization problems, in particular under chance constraints, and we identify natural settings in which it collapses to a single deterministic instance. Finally, we report numerical experiments on positive-definite and indefinite instances which quantify how the model parameters drive the optimal value and solution time, and expose the computational cost of indefiniteness.
Related
- First-Order Methods for Wasserstein Distributionally Robust Constrained Optimization
- Robust Chance-Constrained Optimization using a Continuous Parameter Space Wasserstein-2 Ambiguity Set of Gaussian Mixtures
- Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set
- Calibrating Ambiguity Set via Diagnostic Transport for Distributionally Robust Optimization
- Local-discrepancy ambiguity sets for distributionally robust optimization
BibTeX
@misc{bomze2026distributionally,
title = {{Distributionally robust chance-constrained standard quadratic optimization with Wasserstein ambiguity}},
author = {Immanuel M. Bomze and Daniel De Vicente and Simge Küçükyavuz},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39823},
eprint = {2610.39823},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39823},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Distributionally robust chance-constrained standard quadratic optimization with Wasserstein ambiguity
AU - Immanuel M. Bomze
AU - Daniel De Vicente
AU - Simge Küçükyavuz
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39823
UR - https://arxiv.org/abs/2610.39823
AB - The standard quadratic optimization problem consists of minimizing a quadratic form over the standard simplex. It has highly relevant applications ranging from portfolio optimization to machine learning. However, if the quadratic form is neither convex nor concave, this problem is NP-hard. We study a distributionally robust chance-constrained variant whose ambiguity set is a Wasserstein ball around the sampled distribution and make four contributions. First, although the problem is nonconvex in the decision variable, we exploit its linear dependence on the uncertain matrix to reduce the problem to a mixed-integer quadratic optimization problem. Second, we show that a judicious choice of matrix norm---the entrywise maximum norm---makes this reformulation both exact and tractable, and we describe the induced worst-case distribution. Third, our formulation is, by construction, the minimization of the worst-case Value-at-Risk of the random quadratic form; this unifies it with existing frameworks for uncertain standard quadratic optimization problems, in particular under chance constraints, and we identify natural settings in which it collapses to a single deterministic instance. Finally, we report numerical experiments on positive-definite and indefinite instances which quantify how the model parameters drive the optimal value and solution time, and expose the computational cost of indefiniteness.
ER -