arrow
返回

Optimized Dimensionality Reduction for Moment-Based Distributionally Robust Optimization

delete2025-12-01
delete0
PRE
AI
S
Shiyi Jiang
J
Jianqiang Cheng
K
Kai Pan *
Z
Zuo‐Jun Max Shen *
DOI:10.1287/opre.2023.0645delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Moment-based distributionally robust optimization (DRO) provides an optimization framework to integrate statistical information with traditional optimization approaches. Under this framework, one assumes that the underlying joint distribution of random parameters runs in a distributional ambiguity set constructed by moment information and makes decisions against the worst-case distribution within the set. Although most momentbased DRO problems can be reformulated as semidefinite programming (SDP) problems that can be solved in polynomial time, solving high-dimensional SDPs is still timeconsuming. Unlike existing approximation approaches that first reduce the dimensionality of random parameters and then solve the approximated SDPs, we propose an optimized dimensionality reduction (ODR) approach by integrating the dimensionality reduction of random parameters with the subsequent optimization problems. Such integration enables two outer and one inner approximations of the original problem, all of which are lowdimensional SDPs that can be solved efficiently, providing two lower bounds and one upper bound correspondingly. More importantly, these approximations can theoretically achieve the optimal value of the original high-dimensional SDPs. As these approximations are nonconvex SDPs, we develop modified alternating direction method of multipliers algorithms to solve them efficiently. We demonstrate the effectiveness of our proposed ODR approach and algorithm in solving multiproduct newsvendor and production-transportation problems. Numerical results show significant advantages of our approach regarding computational time and solution quality over the three best possible benchmark approaches. Our approach can obtain an optimal or near-optimal (mostly within 0.1%) solution and reduce the computational time by up to three orders of magnitude.
Keyword:
distributionally robust optimization
dimensionality reduction
principal component analysis
semidefinite programming
data-driven optimization

期刊

O
Operations Research
IF:
2.6
论文数:
97
被引数:
1.5W

机构

H
hong kong polytechnic university
学者数:
3.0W
论文数: 4.1W
被引数: 921
U
university of arizona
学者数:
4.5K
论文数: 2.1K
被引数: 0
University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
学者 查看更多机构
引用论文

引用论文

Joint Estimation and Robustness Optimization
err2022-03-01
err0
PREAI
errTaozeng Zhu; Jingui Xie; Melvyn Sim
err分享
err收藏
Adaptive Distributionally Robust Optimization
err2019-02-01
err0
PREAI
errDimitris Bertsimas; Melvyn Sim; Meilin Zhang
err分享
err收藏
Distributionally Robust Optimization with Principal Component Analysis
err2018-01-01
err0
errOAAI
errJianqiang Cheng; Richard Li-Yang Chen; Habib N. Najm; Ali Pinar; Cosmin Safta; Jean-Paul Watson
err分享
err收藏
Optimization of conditional value-at-risk条件风险价值的优化
err2000-01-01
err0
PREAI
errR. Tyrrell Rockafellar; Stanislav Uryasev
err分享
err收藏
Asymmetry and Ambiguity in Newsvendor Models
err2018-07-01
err0
PREAI
errKarthik Natarajan; Melvyn Sim; Joline Uichanco
err分享
err收藏
Robust Growth-Optimal Portfolios
err2016-07-01
err0
errOAAI
errNapat Rujeerapaiboon; Daniel Kuhn; Wolfram Wiesemann
err分享
err收藏
学者 查看更多内容