Construction of confidence absorbing set for analysis of static stochastic systems
From MaRDI portal
Publication:827962
DOI10.1134/S0005117920040025zbMath1455.93188OpenAlexW3017529171MaRDI QIDQ827962
A. S. Stepanova, A. I. Kibzun, Sergey V. Ivanov
Publication date: 14 January 2021
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117920040025
Related Items (4)
Application of the Smooth Approximation of the Probability Function in Some Applied Stochastic Programming Problems ⋮ On sufficient optimality conditions for a guaranteed control in the speed problem for a linear time-varying discrete-time system with bounded control ⋮ Optimal retention of the trajectories of a discrete-time stochastic system in a tube: one problem statement ⋮ Construction of confidence absorbing sets using statistical methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A method for solving quantile optimization problems with a bilinear loss function
- Mathematical programming approaches for generating \(p\)-efficient points
- Convex set functions in d-space
- Convexity properties of probability and quantile functions in optimization problems
- On the connectedness of probabilistic constraint sets
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- \(\alpha\)-concave functions and measures and their applications
- On convex probabilistic programming with discrete distributions.
- Lectures on Stochastic Programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Eventual convexity of chance constrained feasible sets
This page was built for publication: Construction of confidence absorbing set for analysis of static stochastic systems
