Optimized Dimensionality Reduction for Moment-Based Distributionally Robust Optimization

References

• Bai X, Sun J, Zheng X (2021) An augmented Lagrangian decomposition method for chance-constrained optimization problems. INFORMS J. Comput. 33(3):1056–1069.Link, Google Scholar
• Ban G-Y, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Bertsekas DP (2014) Constrained Optimization and Lagrange Multiplier Methods (Academic Press, New York).Google Scholar
• Bertsimas D, Kallus N (2020) From predictive to prescriptive analytics. Management Sci. 66(3):1025–1044.Link, Google Scholar
• Bertsimas D, Koduri N (2022) Data-driven optimization: A reproducing kernel Hilbert space approach. Oper. Res. 70(1):454–471.Link, Google Scholar
• Bertsimas D, Sim M, Zhang M (2019) Adaptive distributionally robust optimization. Management Sci. 65(2):604–618.Link, Google Scholar
• Bertsimas D, Doan XV, Natarajan K, Teo C-P (2010) Models for minimax stochastic linear optimization problems with risk aversion. Math. Oper. Res. 35(3):580–602.Link, Google Scholar
• Burer S, Monteiro RD (2003) A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Programming 95(2):329–357.Crossref, Google Scholar
• Chen Y, Goulart P (2023) Burer-Monteiro ADMM for large-scale SDPs. Preprint, submitted February 8, https://arxiv.org/abs/2302.04016.Google Scholar
• Chen L, Fu C, Si F, Sim M, Xiong P (2024) Robust optimization with moment-dispersion ambiguity. Oper. Res., ePub ahead of print December 16, https://doi.org/10.1287/opre.2023.0579.Google Scholar
• Cheng J, Delage E, Lisser A (2014) Distributionally robust stochastic knapsack problem. SIAM J. Optim. 24(3):1485–1506.Crossref, Google Scholar
• Cheng J, Li-Yang Chen R, Najm HN, Pinar A, Safta C, Watson J-P (2018) Distributionally robust optimization with principal component analysis. SIAM J. Optim. 28(2):1817–1841.Crossref, Google Scholar
• Cheramin M, Cheng J, Jiang R, Pan K (2022) Computationally efficient approximations for distributionally robust optimization under moment and Wasserstein ambiguity. INFORMS J. Comput. 34(3):1768–1794.Link, Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• Eldén L, Park H (1999) A procrustes problem on the stiefel manifold. Numerical Math. 82(4):599–619.Crossref, Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize. Management Sci. 68(1):9–26.Link, Google Scholar
• Farnia F, Tse D (2016) A minimax approach to supervised learning. Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R, eds. Proc. Adv. Neural Inform. Processing Systems, vol. 29 (MIT Press, Cambridge, MA).Google Scholar
• Gallego G, Moon I (1993) The distribution free newsboy problem: Review and extensions. J. Oper. Res. Soc. 44(8):825–834.Crossref, Google Scholar
• Ghaoui LE, Oks M, Oustry F (2003) Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4):543–556.Link, Google Scholar
• Ghosal S, Wiesemann W (2020) The distributionally robust chance-constrained vehicle routing problem. Oper. Res. 68(3):716–732.Link, Google Scholar
• Goldfarb D, Iyengar G (2003) Robust portfolio selection problems. Math. Oper. Res. 28(1):1–38.Link, Google Scholar
• Gotoh J-y, Konno H (2002) Bounding option prices by semidefinite programming: A cutting plane algorithm. Management Sci. 48(5):665–678.Link, Google Scholar
• Hajinezhad D, Shi Q (2018) Alternating direction method of multipliers for a class of nonconvex bilinear optimization: Convergence analysis and applications. J. Global Optim. 70(1):261–288.Crossref, Google Scholar
• He L, Mak H-Y (2023) Prescriptive PCA: Dimensionality reduction for two-stage stochastic optimization. Preprint, submitted June 4, https://arxiv.org/abs/2306.02223.Google Scholar
• Helmberg C (2002) Semidefinite programming. Eur. J. Oper. Res. 137(3):461–482.Crossref, Google Scholar
• Ho-Nguyen N, Kılınç-Karzan F (2022) Risk guarantees for end-to-end prediction and optimization processes. Management Sci. 68(12):8680–8698.Link, Google Scholar
• Jiang S, Cheng J, Pan K, Shen Z-JM (2023) Optimized dimensionality reduction for moment-based distributionally robust optimization. Preprint, submitted May 6, https://arxiv.org/abs/2305.03996.Google Scholar
• Jiang S, Cheng J, Pan K, Shen Z-JM (2025) Optimized dimensionality reduction for moment-based distributionally robust optimization. https://github.com/jsy1164014200/ODR-MDRO.Google Scholar
• Kallus N, Mao X (2023) Stochastic optimization forests. Management Sci. 69(4):1935–2545.Google Scholar
• Lanckriet GR, Ghaoui LE, Bhattacharyya C, J MI (2002) A robust minimax approach to classification. J. Machine Learn. Res. 3(Dec):555–582.Google Scholar
• Lemon A, So AM-C, Ye Y (2016) Low-rank semidefinite programming: Theory and applications. Frontiers Optim. 2(1–2):1–156.Google Scholar
• Li JY-M (2018) Closed-form solutions for worst-case law invariant risk measures with application to robust portfolio optimization. Oper. Res. 66(6):1533–1541.Link, Google Scholar
• Lin F, Fang X, Gao Z (2022) Distributionally robust optimization: A review on theory and applications. Numerical Algebra Control Optim. 12(1):159–212.Crossref, Google Scholar
• Liu S, He L, Shen Z-JM (2021) On-time last-mile delivery: Order assignment with travel-time predictors. Management Sci. 67(7):4095–4119.Link, Google Scholar
• Liu Y, Meskarian R, Xu H (2017) Distributionally robust reward-risk ratio optimization with moment constraints. SIAM J. Optim. 27(2):957–985.Crossref, Google Scholar
• Lotfi S, Zenios SA (2018) Robust VaR and CVaR optimization under joint ambiguity in distributions, means, and covariances. Eur. J. Oper. Res. 269(2):556–576.Crossref, Google Scholar
• Luo H, Sun X, Li D (2008) On the convergence of augmented lagrangian methods for constrained global optimization. SIAM J. Optim. 18(4):1209–1230.Crossref, Google Scholar
• Mehrotra S, Papp D (2014) A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization. SIAM J. Optim. 24(4):1670–1697.Crossref, Google Scholar
• Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1):115–166.Crossref, Google Scholar
• Natarajan K, Sim M, Uichanco J (2018) Asymmetry and ambiguity in newsvendor models. Management Sci. 64(7):3146–3167.Link, Google Scholar
• Popescu I (2007) Robust mean-covariance solutions for stochastic optimization. Oper. Res. 55(1):98–112.Link, Google Scholar
• Qi M, Shi Y, Qi Y, Ma C, Yuan R, Wu D, Shen Z-JM (2023) A practical end-to-end inventory management model with deep learning. Management Sci. 69(2):759–773.Link, Google Scholar
• Rahimian H, Mehrotra S (2019) Distributionally robust optimization: A review. Preprint, submitted August 13, https://arxiv.org/abs/1908.05659.Google Scholar
• Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2(3):21–42.Crossref, Google Scholar
• Rujeerapaiboon N, Kuhn D, Wiesemann W (2016) Robust growth-optimal portfolios. Management Sci. 62(7):2090–2109.Link, Google Scholar
• Scarf H (1958) A min-max solution of an inventory problem. Stud. in the Math. Theory of Inventory and Production (Stanford University Press, Redwood City, CA), 201–209.Google Scholar
• Shehadeh KS, Cohn AE, Jiang R (2020) A distributionally robust optimization approach for outpatient colonoscopy scheduling. Eur. J. Oper. Res. 283(2):549–561.Crossref, Google Scholar
• Shen Y, Wen Z, Zhang Y (2014) Augmented lagrangian alternating direction method for matrix separation based on low-rank factorization. Optim. Methods Software 29(2):239–263.Crossref, Google Scholar
• Themelis A, Patrinos P (2020) Douglas–Rachford splitting and ADMM for nonconvex optimization: Tight convergence results. SIAM J. Optim. 30(1):149–181.Crossref, Google Scholar
• Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev. 38(1):49–95.Crossref, Google Scholar
• Wang Y, Yin W, Zeng J (2019) Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78:29–63.Crossref, Google Scholar
• Xu H, Liu Y, Sun H (2018) Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods. Math. Programming 169(2):489–529.Crossref, Google Scholar
• Yue J, Chen B, Wang M-C (2006) Expected value of distribution information for the newsvendor problem. Oper. Res. 54(6):1128–1136.Link, Google Scholar
• Yurtsever A, Tropp JA, Fercoq O, Udell M, Cevher V (2021) Scalable semidefinite programming. SIAM J. Math. Data Sci. 3(1):171–200.Crossref, Google Scholar
• Zhang L, Yang J, Gao R (2023) Optimal robust policy for feature-based newsvendor. Management Sci. 70(4):2315–2329.Google Scholar
• Zhang Y, Song S, Shen Z-JM, Wu C (2017) Robust shortest path problem with distributional uncertainty. IEEE Trans. Intelligent Transportation Systems 19(4):1080–1090.Crossref, Google Scholar
• Zhu T, Xie J, Sim M (2022) Joint estimation and robustness optimization. Management Sci. 68(3):1659–1677.Link, Google Scholar
• Zymler S, Kuhn D, Rustem B (2013) Worst-case value at risk of nonlinear portfolios. Management Sci. 59(1):172–188.Link, Google Scholar