Discrete Approximation and Quantification in Distributionally Robust Optimization
Published Online:14 Sep 2018https://doi.org/10.1287/moor.2017.0911
References
- (2014) On distributionally robust multiperiod stochastic optimization. Comput. Management Sci. 11(3):197–220.Crossref, Google Scholar
- (2016) Varying confidence levels for CVaR risk measures and minimax limits. Working paper, University of Sydney, Sydney, NSW, Australia.Google Scholar
- (2006) Measure Theory and Probability Theory (Springer Science+Business Media, New York).Google Scholar
- (2005) Optimal inequalities in probability theory: A convex optimization approach. SIAM J. Optim. 15(3):780–804.Crossref, Google Scholar
- (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
- (1969) The speed of mean Glivenko-Cantelli convergence. Ann. Math. Statist. 40(1):40–50.Crossref, Google Scholar
- (2015) Performance bounds for the scenario approach and an extension to a class of non-convex program. IEEE Trans. Automatic Control 60(1):46–58.Crossref, Google Scholar
- (2002) On choosing and bounding probability metrics. Internat. Statist. Rev. 70(3):419–435.Crossref, Google Scholar
- (2000) Foundations of Quantization for Probability Distributions, Lecture Notes in Mathematics, vol. 1730 (Springer-Verlag, Berlin).Crossref, Google Scholar
- (1952) On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49(4):263–265.Crossref, Google Scholar
- (2005) Robust dynamic programming. Math. Oper. Res. 30(2):257–280.Link, Google Scholar
- (2002) Foundations of Modern Probability (Springer, New York).Crossref, Google Scholar
- (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703–712.Crossref, Google Scholar
- (2017) A semi-infinite programming approach for distributionally robust reward-risk ratio optimization with matrix moments constraints. SIAM J. Optim. 27(2):957–985.Crossref, Google Scholar
- (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
- (2005) Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. 53(5):780–798.Link, Google Scholar
- (2011) Approximations for probability distributions and stochastic optimization problems. Bertocchi M, Consigli G, Dempster MAH, eds. Stochastic Optimization Methods in Finance and Energy, International Series in Operations Research and Management Science, vol. 163 (Springer, New York), 343–387.Crossref, Google Scholar
- (2014) Multistage Stochastic Optimization, Springer Series in Operations Research and Financial Engineering (Springer International Publishing AG, Cham, Switzerland).Crossref, Google Scholar
- (2007) Ambiguity in portfolio selection. Quant. Finance 7(4):435–442.Crossref, Google Scholar
- (2005) A semidefinite programming approach to optimal-moment bounds for convex classes of distributions. Math. Oper. Res. 30(3):632–657.Link, Google Scholar
- (1991) Probability Metrics and the Stability of Stochastic Models (John Wiley & Sons, West Sussex, UK).Google Scholar
- (1975) An application of error bounds for convex programming in a linear space. SIAM J. Control 13(2):271–273.Crossref, Google Scholar
- (2003) Stability of stochastic programming problems. Ruszczyński A, Shapiro A, eds. Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10 (Elsevier, Amsterdam), 483–554.Crossref, Google Scholar
- (2009) The Flaw of Averages: Why We Underestimate Risk in the Face of Uncertainty (John Wiley & Sons, Hoboken, NJ).Google Scholar
- (1958) A min-max solution of an inventory problem. Arrow KJ, Karlin S, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
- (2001) On duality theory of conic linear problems. Goberna MÁ, López MA, eds. Semi-Infinite Programming: Recent Advances (Springer, New York), 135–165.Crossref, Google Scholar
- (2003) Monte Carlo sampling methods. Ruszczyński A, Shapiro A, eds. Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10 (Elsevier, Amsterdam), 353–425.Crossref, Google Scholar
- (2012) Minimax and risk averse multistage stochastic programming. Eur. J. Oper. Res. 219(3):719–726.Crossref, Google Scholar
- (2008) Stochastic mathematical programs with equilibrium constraints, modeling and sample average approximation. Optimization 57(3):395–418.Crossref, Google Scholar
- (2011) Moment inequalities for sums of random matrices and their applications in optimization. Math. Programming 130(1):125–151.Crossref, Google Scholar
- (2016) Convergence analysis for distributionally robust optimization and equilibrium problems. Math. Oper. Res. 41(2):377–401.Link, Google Scholar
- (2013) Robust Markov decision processes. Math. Oper. Res. 38(1):153–183.Link, Google Scholar
- (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
- (2013) Time (in)consistency of multistage distributionally robust inventory models with moment constraints. Optimization Online. Accessed August 20, 2018, http://www.optimization-online.org/DB_HTML/2013/04/3824.html.Google Scholar
- (2018) Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane method. Math. Programming 169(2):489–529.Crossref, Google Scholar
- (2016) Quantitative stability analysis for distributionally robust optimization with moment constraints. SIAM J. Optim. 26(3):1855–1882.Crossref, Google Scholar
- (2015) Data-driven risk-averse two-stage stochastic program with ζ-structure probability metrics. Working paper, University of Florida, Gainesville.Google Scholar
- (2008) Stochastic Global Optimization (Springer, New York).Google Scholar
- (1983) Probability metrics. Theory Probab. Appl. 28(2):264–287.Google Scholar
- (2013) Distributionally robust joint chance constraints with second-order moment information. Math. Programming 137(1–2):167–198.Crossref, Google Scholar

