On smooth approximation of probabilistic criteria in stochastic programming problems
Keywords:
stochastic programming, probability criteria, quantile criteria, approximation, numerical methods, sigmoidal functionAbstract
In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. In this paper we study one of the possible variants of smooth approximation of probability criteria in stochastic programming problems. The research is applied to the optimization problems of the probability function and the quantile function for the loss functional depending on the control vector and one-dimensional absolutely continuous random variable. The main idea of the approximation is to replace the discontinuous Heaviside function in the integral representation of the probability function with a smooth function having such properties as continuity, smoothness, and easily computable derivatives. An example of such a function is the distribution function of a random variable distributed according to the logistic law with zero mean and finite dispersion, which is a sigmoid. The value inversely proportional to the root of the variance is a parameter that provides the proximity of the original function and its approximation. This replacement allows us to obtain a smooth approximation of the probability function, and for this approximation derivatives by the control vector and by other parameters of the problem can be easily found. The article proves the convergence of the probability function approximation obtained by replacing the Heaviside function with the sigmoidal function to the original probability function, and the error estimate of such approximation is obtained. Next, approximate expressions for the derivatives of the probability function by the control vector and the parameter of the function are obtained, their convergence to the true derivatives is proved under a number of conditions for the loss functional. Using known relations between derivatives of probability functions and quantile functions, approximate expressions for derivatives of quantile function by control vector and by the level of probability are obtained. Examples are considered to demonstrate the possibility of applying the proposed estimates to the solution of stochastic programming problems with criteria in the form of a probability function and a quantile function, including in the case of a multidimensional random variable.
References
Lysenko I.V. [Fuzzy optimization: a new approach to problem solving]. Trudy SPIIRAN - SPIIRAS Proceedings. 2004. 1. № 2 (1). pp. 90--118. (In Russ.)
Baburov V.I., Ivancevich N.V., Oljanjuk P.V., Sauta O.I. [Fuzzy criteria and concepts in the problem of GNSS receiver selection for navigation and flight complex]. Trudy SPIIRAN - SPIIRAS Proceedings. 1. № 23 (4). pp. 357--368. (In Russ.)
Fil'chenkov~A.A. [Truth measures and probabilistic graphical models of representation of data with uncertainty] Trudy SPIIRAN - SPIIRAS Proceedings-. 2012. 1. № 23 (4). pp. 254--295. (In Russ.)
Kibzun A.I., Kan Ju.S. Zadachi stohasticheskogo programmirovanija s verojatnostnymi kriterijami. [Stochastic programming problems with probabilistic criteria]. M.: Fizmatlit, 2009. 372 p. (In Russ.)
D. Dentcheva, S. Penev, A. Ruszczyński. Statistical estimation of composite risk functionals and risk optimization problems // Annals of the Institute of Statistical Mathematics. 2017, Vol. 69, Issue 4, pp. 737--760.
D. Dentcheva, A. Ruszczyński. Risk forms: representation, disintegration, and application to partially observable two-stage systems // Mathematical Programming. 2019, pp. 1--21.
A.I. Kibzun, A.V. Naumov, V.I. Norkin. On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem. Automation and Remote Control. June 2013, Volume 74, Issue 6, pp. 951–-967.
A.I. Kibzun, A.N. Ignatov. Reduction of the two-step problem of stochastic optimal control with bilinear model to the problem of mixed integer linear programming. Automation and Remote Control. December 2016, Volume 77, Issue 12, pp. 2175–-2192.
S.V. Ivanov, A.I. Kibzun. Sample Average Approximation in a Two-Stage Stochastic Linear Program with Quantile Criterion. Proceedings of the Steklov Institute of Mathematics. December 2018, Volume 303, Supplement 1, pp. 115–-123.
A.I. Kibzun, V.R. Sobol’. A two-step problem of hedging a European call option under a random duration of transactions. Proceedings of the Steklov Institute of Mathematics. December 2016, Volume 295, Supplement 1, pp. 78-–88.
Rajk Je. [Differentiability by parameter of the probability function and stochastic pseudo-gradient method for its optimization]. Izv. AN JeSSR - Proceedings of the Estonian Academy of Sciences. Physics, Mathematics. 1975, 24, № 1, pp. 3--8. (In Russ.)
Kibzun A.I., Tret'jakov G.L. [Differentiability of the probability function]. Dokl. RAN - Doklady Mathematics. 1997, 354, № 2, pp. 159--161. (In Russ.)
Uryas'ev S.. Derivatives of probability functions and some applications. // Annals of Operations Research. 1995, Vol. 56 Issue 1-4, pp. 287--311.
Uryas'ev S.. Derivatives of probability functions and integrals over sets given by inequalities. // Journal of Computational and Applied Mathematics. 1994, Vol. 56, Issue 1-2, pp. 197--223.
Rene Henrion. Gradient estimates for Gaussian distribution functions: application to probabilistically constrained optimization problems // Numerical Algebra, Control and Optimization, 2012, Vol. 2, 4, pp. 655--668.
Wim van Ackooij, ReneHenrion. (Sub-)Gradient Formulae for Probability Functions of Random Inequality Systems under Gaussian Distribution // SIAM/ASA J. Uncertainty Quantification, 2017, Vol. 5, pp. 63--87.
Georg Ch. Pflug, Heinz Weisshaupt. Probability gradient estimation by set-valued calculus and applications in network design // SIAM Journal on Optimization, 2005, Vol. 15, pp. 898--914.
Yu C, Zelterman D. A general approximation to quantiles. Commun Stat Theory Methods. 2017, 46(19), pp. 9834--9841.
H. Okagbue, M. Adamu, T. Anake. Ordinary Differential Equations of the Probability Functions of the Weibull Distribution and their Application in Ecology. International Journal of Engineering and Future Technology. 2018, 15, pp. 57--78.
J. Garniera, A. Omraneb, Y. Rouchdyc. Asymptotic formulas for the derivatives of probability functions and their Monte Carlo estimations // European Journal of Operational Research, 2009, Vol. 198, Issue 3, pp. 848--858.
A. Mafusalov, S. Uryasev. Buffered Probability of Exceedance: Mathematical Properties and Optimization // SIAM Journal on Optimization, 2018, Vol. 28, 2, pp. 1077--1103.
T. Zhang, S. Uryasev, Y. Guan. Derivatives and subderivatives of buffered probability of exceedance // Operations Research Letters, 2019, Vol. 47, Issue 2, pp 130--132
Shiryaev A. N. Verojatnost'. Kn. 1. 4-e izd., pererab. i dop. [Probability. Vol. 1. Ed. 4]. M., 2007, 552 p. (In Russ.)
Published
How to Cite
Section
Copyright (c) 2020 Виталий Романович Соболь, Роман Олегович Торишный

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms: Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).