2 research outputs found
Minorant methods for stochastic global optimization
We develop numerical methods for solution of stochastic global optimization problems: min and , where x is a finite dimensional decision vector with possible values in the set X, ¦Ø is a random variable, is a nonlinear function of variable x, E and P denote mathematical expectation and probability signs respectively.
These methods are based on the concept of stochastic tangent minorant, which is a random function of two variables x and y with expected value satisfying conditions: (i) , (ii) for all x,y. Tangent minorant is a source of information on a function global behavior. We develop a calculus of (stochastic) tangent minorants.
We develop a stochastic analogue of Pijavski¡¯s global optimization method and a branch and bound method with stochastic minorant bounds.
Applications to optimal facility location and network reliability optimization are discussed
Minorant methods for stochastic global optimization
Abstract. Branch and bound method and Pijavskii's method are extended for solution of global stochastic optimization problems. These extensions employ a concept of stochastic tangent minorants and majorants of the integrand function as a source of global information on the objective function. A calculus of stochastic tangent minorants is developed