Characterization and recovery of optimal distributions in Wasserstein expectation problems with non-convex quadratic functions via single SDP

Abstract We consider the minimization of the expectation of piecewise (not necessarily convex) quadratic function over Wasserstein balls. This expectation problem often appears as a key sub-problem of distributionally robust optimization problems. We present a computationally accessible semidefinite program (SDP)-based characterization for the optimal distribution of this problem, requiring only the optimal solution of a single SDP. We show that strong duality holds between the expectation problem and its SDP dual problem. We then provide a constructive characterization of the associated optimal distributions and prove that they can be explicitly recovered from an optimal solution of the dual of the dual SDP. This result enables the direct computation of the optimal distributions of the expectation problem. Furthermore, we demonstrate through a numerical study on a distributionally robust mean-risk portfolio optimization problem using simulated data that the worst-case distributions can be computed efficiently and utilized to obtain probabilistic interpretation of worst-case solutions.

Authors

Institutions

Publication Details

Journal
Optimization Letters
Published
2026-07-28
DOI
https://doi.org/10.1007/s11590-026-02321-w
Primary Topic
Risk and Portfolio Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Characterization and recovery of optimal distributions in Wasserstein expectation problems with non-convex quadratic functions via single SDP

V. Jeyakumar, Neil D. Dizon
Optimization Letters
Risk and Portfolio Optimization
article

Characterization and recovery of optimal distributions in Wasserstein expectation problems with non-convex quadratic functions via single SDP

V. Jeyakumar, Neil D. Dizon
article en

Abstract

Abstract We consider the minimization of the expectation of piecewise (not necessarily convex) quadratic function over Wasserstein balls. This expectation problem often appears as a key sub-problem of distributionally robust optimization problems. We present a computationally accessible semidefinite program (SDP)-based characterization for the optimal distribution of this problem, requiring only the optimal solution of a single SDP. We show that strong duality holds between the expectation problem and its SDP dual problem. We then provide a constructive characterization of the associated optimal distributions and prove that they can be explicitly recovered from an optimal solution of the dual of the dual SDP. This result enables the direct computation of the optimal distributions of the expectation problem. Furthermore, we demonstrate through a numerical study on a distributionally robust mean-risk portfolio optimization problem using simulated data that the worst-case distributions can be computed efficiently and utilized to obtain probabilistic interpretation of worst-case solutions.

Optimization Letters
UNSW Sydney (AU)
Openalex Percentile: Top 5%
Risk and Portfolio Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.