[1] Shapiro A, Dentcheva D, Ruszczynski A. Lectures on stochastic programming: modeling and theory [M]. Philadelphia: Society for Industrial and Applied Mathematics, 2021. [2] He F, Qu R. A two-stage stochastic mixed-integer program modelling and hybrid solution approach to portfolio selection problems [J]. Information Sciences, 2014, 289: 190-205. [3] Gülten S, Ruszczyński A. Two-stage portfolio optimization with higher-order conditional measures of risk [J]. Annals of Operations Research, 2015, 229: 409-427. [4] Liu C, Fan Y, Ordó nez F. A two-stage stochastic programming model for transportation network protection [J]. Computers & Operations Research, 2009, 36(5): 1582-1590. [5] Barbaroso glu G, Arda Y. A two-stage stochastic programming framework for transportation planning in disaster response [J]. Journal of the Operational Research Society, 2004, 55(1): 43-53. [6] Chen X, Sun H, Xu H. Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems [J]. Mathematical Programming, 2019, 177: 255-289. [7] Zhang D, Xu H, Wu Y. A two stage stochastic equilibrium model for electricity markets with two way contracts [J]. Mathematical Methods of Operations Research, 2010, 71: 1-45. [8] Kim S, Pasupathy R, Henderson S G. A guide to sample average approximation [M]//Fu M. (ed.) Handbook of simulation optimization, New York: Springer, 2015: 207-243. [9] Han Y, Chen Z. Quantitative stability of full random two-stage stochastic programs with recourse [J]. Optimization Letters, 2015, 9(6): 1075-1090. [10] Jiang J, Chen Z. Quantitative stability analysis of two-stage stochastic linear programs with full random recourse [J]. Numerical Functional Analysis & Optimization, 2019, 40(16): 1847- 1876. [11] Zhang S, Guo S, Zhang H, et al. Quantitative stability of full random two-stage problems with quadratic recourse [J]. Optimization, 2019, 68(8): 1551-1576. [12] Lecué G, Lerasle M. Robust machine learning by median-of-means: theory and practice [J]. The Annals of Statistics, 2020, 48(2): 906-931. [13] Tibshirani R. Regression shrinkage and selection via the Lasso [J]. Journal of the Royal Statistical Society: Series B (Methodological), 1996, 58(1): 267-288. [14] Hampel F R. A general qualitative definition of robustness [J]. The Annals of Mathematical Statistics, 1971, 42(6): 1887-1896. [15] Huber P J, Ronchetti E M. Robust statistics [M]. New York: John Wiley & Sons, 2011. [16] Cont R, Deguest R, Scandolo G. Robustness and sensitivity analysis of risk measurement procedures [J]. Quantitative Finance, 2010, 10(6): 593-606. [17] Krätschmer V, Schied A, Zähle H. Qualitative and infinitesimal robustness of tail-dependent statistical functionals [J]. Journal of Multivariate Analysis, 2012, 103(1): 35-47. [18] Krätschmer V, Schied A, Zähle H. Domains of weak continuity of statistical functionals with a view toward robust statistics [J]. Journal of Multivariate Analysis, 2017, 158: 1-19. [19] Steinwart I, Christmann A. Support vector machines [M]. New York: Springer Science & Business Media, 2008. [20] Claus M, Krätschmer V, Schultz R. Weak continuity of risk functionals with applications to stochastic programming [J]. SIAM Journal on Optimization, 2017, 27(1): 91-109. [21] Guo S, Xu H. Statistical robustness in utility preference robust optimization models [J]. Mathematical Programming, 2021, 190(1-2): 679-720. [22] Jiang J, Li S. Statistical robustness of two-stage stochastic variational inequalities [J]. Optimization Letters, 2022, 16(9): 2591-2605. [23] Römisch W. Stability of stochastic programming problems [J]. Stochastic Programming, 2003, 10: 483-554. [24] Goberna M A. Linear semi-infinite optimization [M]. Chichester: EBSCO Publishing, 1998. [25] Klatte D, Thiere G. Error bounds for solutions of linear equations and inequalities [J]. Mathematical Methods of Operations Research, 1995, 41(2): 191-214. [26] Li W. The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program [J]. Linear Algebra and Its Applications, 1993, 187: 15-40. [27] Luo Z, Tseng P. Perturbation analysis of a condition number for linear systems [J]. SIAM Journal on Matrix Analysis and Applications, 1994, 15(2): 636-660. [28] Bonnans J F, Shapiro A. Perturbation analysis of optimization problems [M]. New York: Springer, 2000. [29] Manasevich R F. A min max theorem [J]. Journal of Mathematical Analysis and Applications, 1982, 90(1): 64-71. [30] Güler O, Hoffman A J, Rothblum U G. Approximations to solutions to systems of linear inequalities [J]. SIAM Journal on Matrix Analysis and Applications, 1995, 16(2): 688-696. |