Distributionally Robust Optimization with Confidence Bands for Probability Density Functions

Published Online:https://doi.org/10.1287/ijoo.2021.0059

References

  • 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.LinkGoogle Scholar
  • Bertsimas D, Popescu I (2005) Optimal inequalities in probability theory: A convex optimization approach. SIAM J. Optim. 15(3):780–804.Google Scholar
  • Bertsimas D, Gupta V, Kallus N (2014) Robust sample average approximation. Math. Programming 171(1):217–282.Google Scholar
  • Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.Google Scholar
  • Birge JR, Louveaux F (2011) Introduction to Stochastic Programming (Springer Science & Business Media, New York).Google Scholar
  • Calafiore GC, El Ghaoui L (2006) On distributionally robust chance-constrained linear programs. J. Optim. Theory Appl. 130(1):1–22.Google Scholar
  • Chen YC (2019) Lecture 2: Density estimation. STAT 535: Statistical Machine Learning. Accessed January 22, 2019, http://faculty.washington.edu/yenchic/19A_stat535/Lec2_density.pdf.Google Scholar
  • Chen Z, Sim M, Xu H (2019) Distributionally robust optimization with infinitely constrained ambiguity sets. Oper. Res. 67(5):1328–1344.LinkGoogle Scholar
  • DasGupta A (2019) Finite sample theory of order statistics and extremes. Lecture note. Accessed January 22, 2019, https://www.stat.purdue.edu/ dasgupta/orderstats.pdf.Google Scholar
  • de Klerk E, Kuhn D, Postek K (2019) Distributionally robust optimization with polynomial densities: Theory, models and algorithms. Math. Programming 181(2):265–296.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.LinkGoogle Scholar
  • Duchi J, Glynn P, Namkoong H (2021) Statistics of robust optimization: A generalized empirical likelihood approach. Math. Oper. Res. Forthcoming.Google Scholar
  • Dupačová J (1987) The minimax approach to stochastic programming and an illustrative application. Stochastics 20(1):73–88.Google Scholar
  • 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.LinkGoogle Scholar
  • Erdoğan E, Iyengar G (2006) Ambiguous chance constrained problems and robust optimization. Math. Programming 107(1–2):37–61.Google Scholar
  • Gao R, Kleywegt AJ (2016) Distributionally robust stochastic optimization with Wasserstein distance. Preprint, submitted April 8, https://arxiv.org/abs/1604.02199.Google Scholar
  • Gao R, Chen X, Kleywegt AJ (2017) Wasserstein distributional robustness and regularization in statistical learning. Preprint, submitted December 17, https://arxiv.org/abs/1712.06050.Google Scholar
  • Hanasusanto GA, Kuhn D, Wallace SW, Zymler S (2015) Distributionally robust multi-item newsvendor problems with multimodal demand distributions. Math. Programming 152(1):1–32.Google Scholar
  • Hartigan JA, Hartigan PM (1985) The dip test of unimodality. Ann. Statist. 13(1):70–84.Google Scholar
  • Hengartner NW, Stark PB (1995) Finite-sample confidence envelopes for shape-restricted densities. Ann. Statist. 23(2):525–550.Google Scholar
  • Hu Z, Hong LJ (2013) Kullback-Leibler Divergence Constrained Distributionally Robust Optimization (Optimization Online).Google Scholar
  • Jiang H (2017) Uniform convergence rates for kernel density estimation. Precup D, Teh YW, eds. Internat. Conf. Machine Learn. (JMLR.org, Cambridge, MA), 1694–1703.Google Scholar
  • Jiang R, Guan Y (2015) Data-driven chance constrained stochastic program. Math. Programming 158(1):291–327.Google Scholar
  • Khas’minskii RZ (1976) A lower bound on the risks of non-parametric estimates of densities in the uniform metric. Theory Probab. Appl. 23(4):794–798.Google Scholar
  • Klabjan D, Simchi-Levi D, Song M (2013) Robust stochastic lot-sizing by means of histograms. Production Oper. Management 22(3):691–710.Google Scholar
  • Lam H (2019) Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization. Oper. Res. 67(4):1090–1105.AbstractGoogle Scholar
  • Lam H, Mottet C (2017) Tail analysis without parametric models: A worst-case perspective. Oper. Res. 65(6):1696–1711.LinkGoogle Scholar
  • Li B, Jiang R, Mathieu JL (2018) Ambiguous risk constraints with moment and unimodality information. Math. Programming 173(1):151–192.Google Scholar
  • Lofberg J (2004) YALMIP: A toolbox for modeling and optimization in MATLAB. IEEE Internat. Sympos. Comput. Aided Control Systems Design (IEEE Press, Piscataway, NJ), 284–289.Google Scholar
  • Mak WK, Morton DP, Wood RK (1999) Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1–2):47–56.Google Scholar
  • Mevissen M, Ragnoli E, Yu JY (2013) Data-driven distributionally robust polynomial optimization. Burges C, ed. Adv. Neural Inform. Processing Systems 26 (Neural Information Processing Systems Foundation, Inc., La Jolla, CA), 37–45.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–2):115–166.Google Scholar
  • Natarajan K, Teo CP (2017) On reduced semidefinite programs for second order moment bounds with applications. Math. Programming 161(1):487–518.Google Scholar
  • Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4):1574–1609.Google Scholar
  • Parzen E (1962) On estimation of a probability density function and mode. Ann. Math. Statist. 33(3):1065–1076.Google Scholar
  • Pflug G, Wozabal D (2007) Ambiguity in portfolio selection. Quant. Finance 7(4):435–442.Google Scholar
  • Rinaldo A, Wasserman L (2010) Generalized density clustering. Ann. Statist. 38(5):2678–2722.Google Scholar
  • Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2:21–42.Google Scholar
  • Rosenblatt M (1956) Remarks on some nonparametric estimates of a density function. Ann. Math. Statist. 27(3):832–837.Google Scholar
  • Scarf H (1958) A min-max solution of an inventory problem. Arrow K, Karlin S, Scarf H, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
  • Scott DW (2015) Multivariate Density Estimation: Theory, Practice, and Visualization (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Shapiro A (2001) On duality theory of conic linear problems. Goberna M, López M, eds. Semi-infinite Programming (Springer, Boston), 135–165.Google Scholar
  • Shapiro A, Dentcheva D, Ruszczynski A (2014) Lectures on Stochastic Programming: Modeling and Theory, vol. 16, 2nd ed. (SIAM, Philadelphia).Google Scholar
  • Tsybakov AB (2008) Introduction to Nonparametric Estimation (Springer Science & Business Media, New York).Google Scholar
  • Vandenberghe L, Boyd S, Comanor K (2007) Generalized Chebyshev bounds via semidefinite programming. SIAM Rev. 49(1):52–64.Google Scholar
  • Wang Z, Glynn PW, Ye Y (2016) Likelihood robust optimization for data-driven problems. Comput. Management Sci. 13(2):241–261.Google Scholar
  • Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.LinkGoogle Scholar
  • Zymler S, Kuhn D, Rustem B (2013a) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Google Scholar
  • Zymler S, Kuhn D, Rustem B (2013b) Worst-case value at risk for nonlinear portfolios. Management Sci. 59(1):172–188.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.