Analytic approximation and differentiability of joint chance constraints

References

• Birge JR, Louveaux F. Introduction of stochastic programming. New York: Springer-Verlag; 1997.
   Google Scholar
• Guo S, Xu H, Zhang L. Convergence analysis for mathematical programs with distributionally robust chance constraint. SIAM J Optim. 2017;27(2):784–816. doi: 10.1137/15M1036592
   Web of Science ®Google Scholar
• Kibzun AI, Kan YS. Stochastic programming problems. West Sussex: John Wiley & Sons; 1996.
   Google Scholar
• Prekopa A. Stochastic programming. Dordrecht: Kluwer Academic; 1995.
   Google Scholar
• Marti K. Differentiation formulas for probability functions: the transformation method. Math Prog Ser B. 1996;75:201–220.
   Web of Science ®Google Scholar
• Uryasev S. Derivatives of probability functions and some applications. Ann Oper Res. 1995;56:287–311. doi: 10.1007/BF02031712
   Web of Science ®Google Scholar
• van Ackooij P, Henrion R. Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J Optim. 2014;24:1864–1889. doi: 10.1137/130922689
   Web of Science ®Google Scholar
• Henrion R, Möller AM. A gradient formula for linear chance constraints under Gaussian distribution. Math Oper Res. 2012;37(3):475–488. doi: 10.1287/moor.1120.0544
   Web of Science ®Google Scholar
• van Ackooij P, Henrion R. (Sub-) gradient formulae for probabilistic functions of random inequality constraints under Gaussian distributions. Weierstrass Institute, Berlin, Germany, Preprint No. 2230, 2016.
   Google Scholar
• Luedtke L, Ahmed S. A sample approximation approach for optimization with probabilistic constraints. SIAM J Optim. 2009;19:674–699. doi: 10.1137/070702928
   Web of Science ®Google Scholar
• Pagnoncelli BK, Ahmed S, Shapiro A. Sample average approximation method for chance constrained programming: theory and applications. J Optim Theory Appl. 2009;142:399–416. doi: 10.1007/s10957-009-9523-6
   Web of Science ®Google Scholar
• Sun H, Xu H, Wang Y. Asymptotic analysis of sample average approximation for stochastic optimization problems with joint chance constraints via conditional Value at risk and difference of convex functions. J Optim Theory Appl. 2014;161(1):257–284. doi: 10.1007/s10957-012-0127-1
   Web of Science ®Google Scholar
• Calafiore G, Campi MC. Uncertain convex programs: randomized solutions and confidence levels. Math Prog Ser B. 2005;102(1):25–46. doi: 10.1007/s10107-003-0499-y
   Web of Science ®Google Scholar
• Campi MC, Garetti S. Sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality. J Optim Theory Appl. 2011;148:257–280. doi: 10.1007/s10957-010-9754-6
   Web of Science ®Google Scholar
• Henrion R, Küchler CK, Römisch W. Scenario reduction in stochastic programming with respect to discrepancy distances. Comput Optim Appl. 2009;43:67–93. doi: 10.1007/s10589-007-9123-z
   Web of Science ®Google Scholar
• Ahmed S. Convex relaxation of chance constrained optimization problems. Optim Lett. 2014;8:1–12. doi: 10.1007/s11590-013-0624-7
   Web of Science ®Google Scholar
• Nemirovski A. On safe tractable approximation of chance constraints. Eur J Oper Res. 2012;219:707–718. doi: 10.1016/j.ejor.2011.11.006
   Web of Science ®Google Scholar
• Nemirovski A, Shapiro A. Convex approximation of chance constrained programs. SIAM J Optim. 2006;17:969–996. doi: 10.1137/050622328
   Web of Science ®Google Scholar
• Ermoliev YM, Norkin VI, Wets RJ-B. The minimization of semicontinuous functions: mollifier subgradients. SIAM J Control Optim. 1955;33(1):146–167.
   Google Scholar
• Shan F, Zhang L, Xiao X. A smoothing function approach to joint chance-constrained programs. J Optim Theory Appl. 2014;163:181–199. doi: 10.1007/s10957-013-0513-3
   Web of Science ®Google Scholar
• Hong JL, Yang Y, Zhang L. Sequential convex approximations to joint chance constrained programs: a Monte Carlo approach. Oper Res. 2011;59:617–630. doi: 10.1287/opre.1100.0910
   Web of Science ®Google Scholar
• Geletu A, Klöppel M, Hoffmann A, et al. A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties. Eng Optim. 2015;47(4):495–520. doi: 10.1080/0305215X.2014.905550
   Web of Science ®Google Scholar
• Geletu A, Klöppel M, Hoffmann A, et al. An inner-outer approximation approach to chance constrained optimization. SIAM J Optim. 2017;27(3):1834–1857. doi: 10.1137/15M1049750
   Web of Science ®Google Scholar
• Henrion R. Chance constrained problems. Weierstraß Institut für Angewandte Analysis und Stochastik, Pre-Conf., PhD-Workshop, 2009 August 15; Available from https://www.stoprog.org/sites/default/files/tutorials/SP10/Henrion.pdf.
   Google Scholar
• Dieudonne J. Éleménts d'Analyse. 2nd ed. Bruxelles, Montréal: Revue at augmentée Gauthier-Villars, Editeur Paris; 1974, Tom II, Chapitres XII à XV.
   Google Scholar
• Jongen HTh, Twilt F, Weber GW. Semi-infinite optimization: structure and stability of the feasible set. J Optim Theory Appl. 1992;72:529–552. doi: 10.1007/BF00939841
   Web of Science ®Google Scholar
• Dieudonne J. Nonstandard analysis in practice. 7th ed. New York, London: Academic Press; 1968.
   Google Scholar
• Jongen HTh, Jonker P, Twilt F. Nonlinear optimization in finite dimensions. Dordrecht: Kluwer Academic Publishers; 2000.
   Google Scholar
• Rudin W. Real and complex analysis. 3rd ed. New York: McGraw-Hill; 1987.
   Google Scholar
• Natanson IP. Theorie der Funktionen einer reellen Veränderlichen. Berlin: Akademie-Verlalg; 1981.
   Google Scholar
• Robinson SM. Stability theorems of inequalities. Part II: differentiable nonlinear systems. Math Oper Res. 1976;1:130–143. doi: 10.1287/moor.1.2.130
   Google Scholar