Stochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
نویسندگان
چکیده
We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimization problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty function. We also establish an asymptotic normality result for the algorithm with smooth penalty functions under minor assumptions. Numerical results are given to compare the performance of the proposed algorithm with different penalty functions.
منابع مشابه
Stochastic optimisation with inequality constraints using simultaneous perturbations and penalty functions
We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimisation problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty functi...
متن کاملA Constrained Simultaneous Perturbation Stochastic Approximation Algorithm Based on Penalty Function - Intelligent Control (ISIC), 1998. Held jointly with IEEE International Symposium on Computational
1.1. Available Techniques In this paper, we present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimization problems with general inequality constraints. We also presents a very general convergence result for the proposed algorithm.
متن کاملGlobal Optimization Method for Design Problems
Article history: Received: 13.2.2015. Received in revised form: 24.3.2015. Accepted: 27.3.2015. In structural design optimization method, numerical techniques are increasingly used. In typical structural optimization problems there may be many locally minimum configurations. For that reason, the application of a global method, which may escape from the locally minimum points, remains essential....
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملGlobal Competitive Ranking for Constraints Handling with Modified Differential Evolution
Constrained nonlinear programming problems involving a nonlinear objective function with inequality and/or equality constraints introduce the possibility of multiple local optima. The task of global optimization is to find a solution where the objective function obtains its most extreme value while satisfying the constraints. Depending on the nature of the involved functions many solution metho...
متن کامل