Star-shaped approximation approach for stochastic programming problems with probability function (Q4484949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1455259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Star-shaped approximation approach for stochastic programming problems with probability function |
scientific article; zbMATH DE number 1455259 |
Statements
Star-shaped approximation approach for stochastic programming problems with probability function (English)
0 references
17 June 2001
0 references
probability function
0 references
stochastic quasi-gradient algorithm
0 references
Monte Carlo method
0 references
0.8043359518051147
0 references
0.7989448308944702
0 references
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.
0 references