Advertisement

Estimation of the Necessary Sample Size for Approximation of Stochastic Optimization Problems with Probabilistic Criteria

  • Sergey V. IvanovEmail author
  • Irina D. Zhenevskaya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)

Abstract

Stochastic optimization problems with probabilistic and quantile objective functions are considered. The probability objective function is defined as the probability that the value of losses does not exceed a fixed level. The quantile function is defined as the minimal value of losses that cannot be exceeded with a fixed probability. Sample approximations of the considered problems are formulated. A method to estimate the accuracy of the approximation of the probability maximization and quantile minimization is described for the case of a finite set of feasible strategies. Based on this method, we estimate the necessary sample size to obtain (with a given probability) an epsilon-optimal strategy to the original problems by solving their approximations in the cases of finite set of feasible strategies. Also, the necessary sample size is obtained for the probability maximization in the case of a bounded infinite set of feasible strategies and a Lipschitz continuous probability function.

Keywords

Stochastic optimization Sample approximation Probability function Quantile function 

Notes

Acknowledgements

The work is supported by the Russian Foundation for Basic Research (project 19-07-00436).

References

  1. 1.
    Kibzun, A.I., Kan, Y.S.: Stochastic Programming Problems with Probability and Quantile Functions. Wiley, Chichester, New York, Brisbane, Toronto, Singapore (1996)zbMATHGoogle Scholar
  2. 2.
    Artstein, Z., Wets, R.J.-B.: Consistency of minimizers and the SLLN for stochastic programs. J. Convex Anal. 2, 1–17 (1996)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142, 399–416 (2009).  https://doi.org/10.1007/s10957-009-9523-6MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Kibzun, A.I., Ivanov, S.V.: On the convergence of sample approximations for stochastic programming problems with probabilistic criteria. Automat. Remote Control. 79(2), 216–228 (2018).  https://doi.org/10.1134/S0005117918020029MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Hess, C., Seri, R.: Generic consistency for approximate stochastic programming and statistical problems. SIAM J. Optim. 29(1), 290–317 (2019).  https://doi.org/10.1137/17M1156769MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Guigues, V., Juditsky, A., Nemirovski, A.: Non-asymptotic confidence bounds for the optimal value of a stochastic program. Optim. Method. Softw. 32(5), 1033–1058 (2017).  https://doi.org/10.1080/10556788.2017.1350177MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kibzun, A.I., Naumov, A.V., Norkin, V.I.: On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem. Automat. Remote Control. 74(6), 951–967 (2013).  https://doi.org/10.1134/S0005117913060064MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Shapiro, A.: Monte Carlo sampling methods. In: Ruszczyński, A., Shapiro, A. (eds.) Handbooks in OR Handbooks in Operations Research and Management Science & MS, North-Holland, Dordrecht, The Netherlands, vol. 10, pp. 353–425 (2003).  https://doi.org/10.1016/S0927-0507(03)10006-0
  9. 9.
    Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on Stochastic Programming. Society for Industrial and Applied Mathematics, Philadelphia (2009)CrossRefGoogle Scholar
  10. 10.
    Kleywegt, A.J., Shapiro, A., Homem-De-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12(2), 479–502 (2001).  https://doi.org/10.1137/S1052623499363220MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674–699 (2008).  https://doi.org/10.1137/070702928MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-02431-3CrossRefzbMATHGoogle Scholar
  13. 13.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)CrossRefGoogle Scholar
  14. 14.
    Kibzun, A., Uryasev, S.: Differentiability of probability function. Stochast. Anal. Appl. 16(6), 1101–1128 (1998).  https://doi.org/10.1080/07362999808809581MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Van Ackooij, W., Henrion, R.: Gradient formulae for nonlinear probabilistic constraints with Gaussian and Gaussian-like distributions. SIAM J. Optim. 24(4), 1864–1889 (2014).  https://doi.org/10.1137/130922689MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Mosteller, F.: One some useful inefficient statistics. Ann. Math. Stat. 17, 317–408 (1946)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Moscow Aviation Institute (National Research University)MoscowRussia

Personalised recommendations