Distributionally Robust Chance Constrained Geometric Optimization

References

• [1] Bawa VS (1973) On chance constrained programming problems with joint constraints. Management Sci. 19(11):1326–1331.Link, Google Scholar
• [2] Ben-Tal A, Den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.Link, Google Scholar
• [3] Bertsimas D, Popescu I (2005) Optimal inequalities in probability theory: A convex optimization approach. SIAM J. Optim. 15(3):780–804.Crossref, Google Scholar
• [4] Bomze I, Cheng J, Dickinson P, Lisser A, Liu J (2019) Notoriously hard (mixed-)binary QPs: Empirical evidence on new completely positive approaches. Comput. Management Sci. 16:593–619.Crossref, Google Scholar
• [5] Boyd S, Kim SJ, Vandenberghe L, Hassibi A (2007) A tutorial on geometric programming. Optim. Eng. 8:67–127.Crossref, Google Scholar
• [6] Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Programming 120(2):479–495.Crossref, Google Scholar
• [7] Chassein A, Goerigk M (2014) Robust Geometric Programming Is Co-NP Hard (Technische Université Kaiserslautern, Fachbereich Mathematik).Google Scholar
• [8] Chen Z, Kuhn D, Wiesemann W (2018) Data-driven chance constrained programs over Wasserstein balls. Preprint, submitted September 1, https://arxiv.org/abs/1809.00210.Google Scholar
• [9] Chen Z, Peng S, Liu J (2018) Data-driven robust chance constrained problems: A mixture model approach. J. Optim. Theory Appl. 179(3):1065–1085.Crossref, Google Scholar
• [10] Chen W, Sim M, Sun J, Teo CP (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470–485.Link, Google Scholar
• [11] Cheng J, Lisser A (2012) A second-order cone programming approach for linear programs with joint probabilistic constraints. Oper. Res. Lett. 40(5):325–328.Crossref, Google Scholar
• [12] Cheng J, Delage E, Lisser A (2014) Distributionally robust stochastic knapsack problem. SIAM J. Optim. 24(3):1485–1506.Crossref, Google Scholar
• [13] Cheng J, Houda M, Lisser A (2015) Chance constrained 0-1 quadratic programs using copulas. Optim. Lett. 9(7):1283–1295.Crossref, Google Scholar
• [14] Chung SJ (1989) NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60(3):393–399.Crossref, Google Scholar
• [15] 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
• [16] Duffin R, Peterson E, Zener C (1967) Geometric Programming-Theory and Application (Wiley, New York).Google Scholar
• [17] Dupačová J (2009) Stochastic geometric programming: Approaches and applications. Brožová V, Kvasnička R, eds. Proc. MME09, 63–66.Google Scholar
• [18] Ecker J (1980) Geometric programming: Methods, computations and applications. SIAM Rev. 22(3):338–362.Crossref, Google Scholar
• [19] El Ghaoui L, 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
• [20] Embrechts P, McNeil A, Straumann D (2002) Correlation and dependence in risk management: Properties and pitfalls. Dempster MAH, ed. Risk Management: Value at Risk and Beyond (Cambridge University Press, Cambridge, UK), 176–223.Google Scholar
• [21] Esfahani PM, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1–2):115–166.Crossref, Google Scholar
• [22] Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted April 8, https://arxiv.org/abs/1604.02199.Google Scholar
• [23] Gao R, Kleywegt AJ (2017) Distributionally robust stochastic optimization with dependence structure. Preprint, submitted January 16, https://arxiv.org/abs/1701.04200.Google Scholar
• [24] Hanasusanto GA, Kuhn D (2018) Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls. Oper. Res. 66(3):849–869.Link, Google Scholar
• [25] Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2015) A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Programming 151(1):35–62.Crossref, Google Scholar
• [26] Hanasusanto GA, Roitch V, Kuhn D, Wiesemann W (2017) Ambiguous joint chance constraints under mean and dispersion information. Oper. Res. 65(3):751–767.Link, Google Scholar
• [27] Henrion R, Strugarek C (2011) Convexity of chance constraints with dependent random variables: The use of copulae. Bertocchi M, Consigli G, Dempster M, eds. Stochastic Optimization Methods in Finance and Energy: New Financial Products and Energy Market Strategies, International Series in Operations Research and Management Science (Springer-Verlag, New York), 427–439.Crossref, Google Scholar
• [28] Hiriart-Urruty JB, Seeger A (2010) A variational approach to copositive matrices. SIAM Rev. 52(4):593–629.Crossref, Google Scholar
• [29] Hsiung KL, Kim SJ, Boyd S (2005) Power control in lognormal fading wireless channels with uptime probability specifications via robust geometric programming. Proc. 2005 IEEE Amer. Control Conf., 3955–3959.Google Scholar
• [30] Hsiung KL, Kim SJ, Boyd S (2008) Tractable approximate robust geometric programming. Optim. Engrg. 9(2):95–118.Crossref, Google Scholar
• [31] Hu Z, Hong LJ (2013) Kullback-Leibler divergence constrained distributionally robust optimization. Technical report, The Hong Kong University of Science and Technology.Google Scholar
• [32] Jagannathan R (1974) Chance-constrained programming with joint constraints. Oper. Res. 22(2):358–372.Link, Google Scholar
• [33] Ji R, Lejeune M (2021) Data-driven distributionally robust chance-constrained optimization with Wasserstein metric. J. Global Optim. 79:779–811.Crossref, Google Scholar
• [34] Jiang R, Guan Y (2016) Data-driven chance constrained stochastic program. Math. Programming 158(1):291–327.Crossref, Google Scholar
• [35] Liu J, Lisser A, Chen Z (2016) Stochastic geometric program with joint chance constraint. Oper. Res. Lett. 44(5):687–691.Crossref, Google Scholar
• [36] Lobo MS, Boyd S (2000) The worst-case risk of a portfolio. Technical report, Stanford University, CA.Google Scholar
• [37] Maranas CD, Floudas CA (1997) Global optimization in generalized geometric programming. Comput. Chemical Engrg. 21(4):351–369.Crossref, Google Scholar
• [38] Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and nonlinear programming. Math. Programming 39:117–129.Crossref, Google Scholar
• [39] Natarajan K, Sim M, Uichanco J (2010) Tractable robust expected utility and risk models for portfolio optimization. Math. Finance 20(4):695–731.Crossref, Google Scholar
• [40] Natarajan K, Teo CP, Zheng Z (2011) Mixed zero-one linear programs under objective uncertainty: A completely positive representation. Oper. Res. 59(3):713–728.Link, Google Scholar
• [41] Peterson E (1976) Geometric programming. SIAM Rev. 18(1):1–51.Crossref, Google Scholar
• [42] Pflug GC, Wozabal D (2007) Ambiguity in portfolio selection. Quant. Finance 7(4):435–442.Crossref, Google Scholar
• [43] Puccetti G, Wang R (2015) Extremal dependence concepts. Statist. Sci. 30(4):485–517.Crossref, Google Scholar
• [44] Rao SS (1996) Engineering Optimization: Theory and Practice, 3rd ed. (Wiley-Interscience, New York).Google Scholar
• [45] Rujeerapaiboon N, Kuhn D, Wiesemann W (2015) Robust growth-optimal portfolios. Management Sci. 62(7):2090–2109.Link, Google Scholar
• [46] Rujeerapaiboon N, Kuhn D, Wiesemann W (2018) Chebyshev inequalities for products of random variables. Math. Oper. Res. 43(3):887–918.Link, Google Scholar
• [47] Scarf H (1958) A min-max solution of an inventory problem. Arrow KJ, Karlin S, Scarf HE, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
• [48] Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• [49] Wozabal D (2014) Robustifying convex risk measures for linear portfolios: A nonparametric approach. Oper. Res. 62(6):1302–1315.Link, Google Scholar
• [50] Xie W (2019) On distributionally robust chance constrained programs with Wasserstein distance. Math. Programming 186:115–155.Crossref, Google Scholar
• [51] Xu G, Burer S (2018) A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput. Optim. Appl. 70(1):33–59.Crossref, Google Scholar
• [52] Xu G, Hanasusanto GA (2018) Improved decision rule approximations for multi-stage robust optimization via copositive programming. Preprint, submitted August 19, https://arxiv.org/abs/1808.06231.Google Scholar
• [53] Yu Y, Li Y, Schuurmans D, Szepesvari C (2009) A general projection property for distribution families. Adv. Neural Inform. Processing Systems 22:2232–2240.Google Scholar
• [54] Žácková J (1966) On minimax solutions of stochastic linear programming problems. Časopis pro Pěstování Matematiky 91:423–430.Google Scholar
• [55] Zhu S, Fukushima M (2009) Worst-case conditional value-at-risk with application to robust portfolio management. Oper. Res. 57(5):1155–1168.Link, Google Scholar