Star-shaped approximation approach for stochastic programming problems with probability function
The paper presents a new technique for approximating the probability function which is needed to solve some Stochastic Programs. It needs only of some standard assumptions and the functions exhibit desirable properties. The proposed star shaped approximation is characterized through 2 lemmata and 2 theorems. When the hypothesis, used in the Theorems, hold the objective in the stochastic programming problems can be replaced by a lower estimate of the involved probability \(P_M (u)\). An algorithm is proposed and an artificial example is used for illustrating the performance of 3 stochastic quasi-gradient algorithms which can be used for solving it. The proposed one is the fastest and the less sensitive to large values of the probability function.
- scientific article; zbMATH DE number 4037608
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- scientific article; zbMATH DE number 3878686
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- scientific article; zbMATH DE number 617921
- Maximization of the probability function: an algorithm based on the star-shaped approximation
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- Application of the smooth approximation of the probability function in some applied stochastic programming problems
This page was built for publication: Star-shaped approximation approach for stochastic programming problems with probability function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484949)