Nonlinear Separation for Constrained Multiobjective Optimization Problems and Applications to Penalty Functions
نویسنده
چکیده
In this paper, we prove a nonlinear separation associated with a constrained multiobjective optimization problem in the image space, as well as the equivalence between the existence of nonlinear separation function and a saddle point condition for a generalized Lagrangian function associated with the given problem. As applications, we obtain some equivalent conditions on exact penalty methods for the given problem.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملThreshold Based Penalty Functions for Constrained Multiobjective Optimization
This paper compares the performance of our recently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems (CMOPs). As a result, the capability ...
متن کاملPenalty Function Approach for Constrained Convolutive Blind Source Separation
A new approach for convolutive blind source separation (BSS) using penalty functions is proposed in this paper. Motivated by nonlinear programming techniques for the constrained optimization problem, it converts the convolutive BSS into a joint diagonalization problem with unconstrained optimization. Theoretical analyses together with numerical evaluations reveal that the proposed method not on...
متن کامل