Abstract
In this paper, the problem of constructing the confidence absorbing set is considered as follows: find the set of initial positions of a system for which at a terminal time instant a loss function will not exceed some fixed level with a given probability. The dependence of the system’s state at the terminal time instant on its initial position is assumed to be a known random function. An approach to construct outer and inner approximations of the confidence absorbing set is proposed. In the first stage, deterministic inner and outer approximations are obtained. Then, these approximations are refined for a certain finite set of initial positions of the system using sample estimates. The sample size sufficient to construct the approximations is estimated. The latter estimate is improved for the case of a star-shaped loss function. An algorithm for constructing approximations of the confidence absorbing set in the two-dimensional case is developed. The resulting approximations are used in a production planning problem.
Similar content being viewed by others
References
Kibzun, A. I. & Kan, Yu. S. Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami (Stochastic Programming Problems with Probability Criteria). (Fizmatlit, Moscow, 2009).
Prékopa, A. Stochastic Programming. (Kluwer, Dordrecht-Boston, 1995).
Tamm, E. On Quasiconvexity of Probability Functions and Quantiles. Izv. Akad. Nauk. Est. SSR, Fiz.-Mat. 25(no. 2), 141–144 (1976).
Kan, Yu. S. & Kibzun, A. I. Convexity Properties of Probability Functions and Quantiles in Optimization Problems. Autom. Remote Control 57(no. 3), 368–383 (1996).
Van Ackooij, W. Eventual Convexity of Chance Constrained Feasible Sets. Optimization (J. Math. Programm. Oper. Res.) 64(no. 5), 1263–1284 (2015).
Prékopa, A. On Logarithmic Concave Measures and Functions. Acta Sci. Math. (Szeged) 34, 335–343 (1973).
Borell, C. Convex Set Functions in d-Space. Period. Math. Hung. 6(no. 2), 111–136 (1975).
Norkin, V. I. & Roenko, N. V. α-Concave Functions and Measures and Their Applications. Cybern. Syst. Anal. 27(no. 6), 860–869 (1991).
Lejeune, M. & Noyan, N. Mathematical Programming Approaches for Generating p=Efficient Points. Eur. J. Oper. Res. 207, 590–600 (2010).
Dentcheva, D., Prékopa, A. & Ruszczyński, A. On Convex Probabilistic Programming with Discrete Distribution. Nonlin. Anal. 47, 1997–2009 (2001).
Van Ackooij, W., Berge, V., de Oliveira, W. & Sagastizábal, C. Probabilistic Optimization via Approximate p-Efficient Points and Bundle Methods. Comput. Oper. Res. 77, 177–193 (2017).
Lejeune, M.A. and Prékopa, A.Relaxations for Probabilistically Constrained Stochastic Programming Problems: Review and Extensions, Ann. Oper. Res., 2018. https://doi.org/10.1007/s10479-018-2934-8
Vapnik, V. N. & Chervonenkis, A. Ya Teoriya raspoznavaniya obrazov (statisticheskie problemy obucheniya) (Theory of Image Recognition (Statistical Problems of Learning)). (Nauka, Moscow, 1974).
Vapnik, V. N. & Chervonenkis, A. Ya On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory Probab. Appl. 16(no. 2), 264–280 (1971).
Shapiro, A.Monte Carlo Sampling Methods, in Handbooks in Operations Research and Management Science, Ruszczyński, A. and Shapiro, A., Eds., vol. 10, pp. 353–425, Dordrecht: North-Holland, 2003.
Shapiro, A., Dentcheva, D., and Ruszczyński, A.Lectures on Stochastic Programming. Modeling and Theory, Philadelphia: Society for Industrial and Applied Mathematics (SIAM), 2014.
Kleywegt, A. J., Shapiro, A. & Homem-De-Mello, T. The Sample Average Approximation Method for Stochastic Discrete Optimization. SIAM J. Optim. 12(no. 2), 479–502 (2001).
Luedtke, J. & Ahmed, S. A Sample Approximation Approach for Optimization with Probabilistic Constraints. SIAM J. Optim. 19(no. 2), 674–699 (2008).
Kibzun, A. I., Ivanov, S. V. & Stepanova, A. S. Construction of Confidence Absorbing Set for Analysis of Static Stochastic Systems. Autom. Remote Control 81(no. 4), 589–601 (2020).
Vasil’eva, S. N. & Kan, Yu. S. Approximation of Probabilistic Constraints in Stochastic Programming Problems with a Probability Measure Kernel. Autom. Remote Control 80(no. 11), 2005–2016 (2019).
Vasil’eva, S. N. & Kan, Yu. S. Linearization Method for Solving Quantile Optimization Problems with Loss Function Depending on a Vector of Small Random Parameters. Autom. Remote Control 78(no. 7), 1251–1263 (2017).
Shiryaev, A.N.Probability-1,2, New York: Springer-Verlag, 2019, 3rd ed.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kibzun, A., Ivanov, S. Construction of Confidence Absorbing Sets Using Statistical Methods. Autom Remote Control 81, 2206–2219 (2020). https://doi.org/10.1134/S000511792012005X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S000511792012005X