Skip to main content
SpringerLink
Log in

Construction of Confidence Absorbing Set for Analysis of Static Stochastic Systems

  • Topical Issue
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

The problem of constructing the confidence absorbing set for the analysis of static stochastic systems is considered. The confidence absorbing set is understood as the set of initial positions for which at a terminal time instant a system will not leave an admissible domain with a given probability. Some properties of the confidence absorbing set, in particular, convexity, are established. An algorithm for constructing an inner approximation of the confidence absorbing set based on the confidence method is proposed. The properties of this approximation are established. The results obtained are used for predicting wind speed in the vicinity of a landing airfield. Calculations for a numerical experiment are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Liptser, R.S. and Shiryaev, A.N., Statistics of Random Processes I,II, Applications of Mathematics, vols. 5,6, Berlin: Springer-Verlag, 2001.

    Book  Google Scholar 

  2. Kibzun, A.I. and Kan, Y.S., Stochastic Programming Problems with Probability and Quantile Functions, Chichester: Wiley, 1996.

    MATH  Google Scholar 

  3. Kibzun, A.I. and Kan, Yu.S., Zadachi stokhasticheskogo programmirovaniya s veroyatnostnymi kriteriyami (Stochastic Programming Problems with Probability Criteria), Moscow: Fizmatlit, 2009.

    Google Scholar 

  4. Prékopa, A., Stochastic Programming, Dordrecht: Kluwer, 1995.

    Book  Google Scholar 

  5. Shapiro, A., Dentcheva, D., and Ruszczyński, A., Lectures on Stochastic Programming. Modeling and Theory, Philadelphia: SIAM, 2009.

    Book  Google Scholar 

  6. Tamm, E., On Quasiconvexity of Probability Functions and Quantiles, Izv. Akad. Nauk. Est. SSR, Fiz.-Mat., 1976, vol. 25, no. 2, pp. 141–144.

    MathSciNet  MATH  Google Scholar 

  7. Kan, Yu.S. and Kibzun, A.I., Convexity Properties of Probability Functions and Quantiles in Optimization Problems, Autom. Remote Control, 1996, vol. 57, no. 3, pp. 368–383.

    MATH  Google Scholar 

  8. Van Ackooij, W., Eventual Convexity of Chance Constrained Feasible Sets, Optimization (J. Math. Programm. Oper. Res.), 2015, vol. 64, no. 5, pp. 1263–1284.

    MathSciNet  MATH  Google Scholar 

  9. Prékopa, A., Logarithmic Concave Measures with Application to Stochastic Programming, Acta Sci. Math. (Szeged), 1971, vol. 32, pp. 301–316.

    MathSciNet  MATH  Google Scholar 

  10. Prékopa, A., On Logarithmic Concave Measures and Functions, Acta Sci. Math. (Szeged), 1973, vol. 34, pp. 335–343.

    MathSciNet  MATH  Google Scholar 

  11. Borell, C., Convex Set Functions in d-Space, Period. Math. Hung., 1975, vol. 6, no. 2, pp. 111–136.

    Article  MathSciNet  Google Scholar 

  12. Norkin, V.I. and Roenko, N.V., α-Concave Functions and Measures and Their Applications, Cybern. Syst. Anal., 1991, vol. 27, no. 6, pp. 860–869.

    Article  MathSciNet  Google Scholar 

  13. Henrion, R., On the Connectedness of Probabilistic Constraint Sets, J. Optim. Theory Appl., 2002, vol. 112, no. 3, pp. 657–663.

    Article  MathSciNet  Google Scholar 

  14. Prékopa, A., Dual Method for the Solution of a One-Stage Stochastic Programming Problem with Random RHS Obeying a Discrete Probability Distribution, ZOR, 1990, vol. 34, pp. 441–461.

    MathSciNet  MATH  Google Scholar 

  15. Lejeune, M. and Noyan, N., Mathematical Programming Approaches for Generating p-Efficient Points, Eur. J. Oper. Res., 2010, vol. 207, pp. 590–600.

    Article  MathSciNet  Google Scholar 

  16. Dentcheva, D., Prékopa, A., and Ruszczyński, A., On Convex Probabilistic Programming with Discrete Distribution, Nonlin. Anal., 2001, vol. 47, pp. 1997–2009.

    Article  MathSciNet  Google Scholar 

  17. Van Ackooij, W., Berge, V., de Oliveira, W., and Sagastizábal, C., Probabilistic Optimization via Approximate p-Efficient Points and Bundle Methods, Comput. Oper. Res., 2017, vol. 77, pp. 177–193.

    Article  MathSciNet  Google Scholar 

  18. 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

    Google Scholar 

  19. Vasil’eva, S.N. and Kan, Yu.S., A Method for Solving Quantile Optimization Problems with a Bilinear Loss function, Autom. Remote Control, 2015, vol. 76, no. 9, pp. 1582–1597.

    Article  MathSciNet  Google Scholar 

  20. Vasil’eva, S.N. and Kan, Yu.S., A Visualization Algorithm for the Plane Probability Measure Kernel, Informat. Primen., 2018, vol. 12, no. 2, pp. 60–68.

    Google Scholar 

  21. Kibzun, A.I. and Malyshev, V.V., A Generalized Minimax Approach to the Solution of Problems with Probability Constraints, Izv. Akad. Nauk SSSR, Tekh. Kibern., 1984, no. 1, pp. 20–29.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Aviation Institute (National Research University), Moscow, Russia

    A. I. Kibzun, S. V. Ivanov & A. S. Stepanova

Authors
  1. A. I. Kibzun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. S. Stepanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to A. I. Kibzun, S. V. Ivanov or A. S. Stepanova.

Additional information

This paper was recommended for publication by E.Ya. Rubinovich, a member of the Editorial Board

Russian Text © The Author(s), 2020, published in Avtomatika i Telemekhanika, 2020, No. 4, pp. 21–36.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kibzun, A.I., Ivanov, S.V. & Stepanova, A.S. Construction of Confidence Absorbing Set for Analysis of Static Stochastic Systems. Autom Remote Control 81, 589–601 (2020). https://doi.org/10.1134/S0005117920040025

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117920040025

Keywords

Search

Navigation