On generalized-convex constrained multi-objective optimization
Christian GŁnther (Christian.Guenthermathematik.uni-halle.de)
Abstract: In this paper, we consider multi-objective optimization problems involving not necessarily convex constraints and componentwise generalized-convex (e.g., semi-strictly quasi-convex, quasi-convex, or explicitly quasi-convex) vector-valued objective functions that are acting between a real linear topological pre-image space and a finite dimensional image space. For these multi-objective optimization problems, we show that the set of (strictly, weakly) efficient solutions can be computed completely by using at most two corresponding multi-objective optimization problems with a new feasible set that is a convex upper set of the original feasible set. Our approach relies on the fact that the original feasible set can be described using level sets of a certain real-valued function (a kind of penalization function). Finally, we apply our approach to problems where the constraints are given by a system of inequalities with a finite number of constraint functions.
Keywords: Multi-objective optimization, Pareto efficiency, Generalized convexity, Constrained optimization, Convex and nonconvex constraints, Slater constraint qualification
Category 1: Other Topics (Multi-Criteria Optimization )
Category 2: Convex and Nonsmooth Optimization (Generalized Convexity/Monoticity )
Category 3: Nonlinear Optimization (Constrained Nonlinear Optimization )
Citation: Accepted for publication in "Pure and Applied Functional Analysis", 2017 (see http://www.ybook.co.jp/pafa.html).
Entry Submitted: 04/01/2017
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|