Characterizations of efficient and weakly efficient points in nonconvex vector optimization
type: Item
instance of: scholarly article
title: Characterizations of efficient and weakly efficient points in nonconvex vector optimization
zbMATH Open document ID: 1342.90221
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
review text: The authors derive a necessary and sufficient condition for weak efficiency and a sufficient criteria for efficiency of nonconvex nonsmooth vector optimization problems involving inequality constraints and a closed convex set constraint with C(T)-valued mappings in terms of the Clarke subdifferentials under suitable generalized convexity together with some special cases.
reviewed by: Do Van Luu
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6419110
zbMATH Keywords: ptimality conditions
zbMATH Keywords: nonconvex vector optimization
zbMATH Keywords: efficient point
zbMATH Keywords: weakly efficient point
zbMATH Keywords: linearizing cone
author: Kequan Zhao
author: Xinmin Yang
MaRDI profile type: Publication
full work available at URL: s10898-014-0191-1
OpenAlex ID: W1980323035
cites work: Proper Efficient Points for Maximizations with Respect to Cones
cites work: Q4461359
cites work: Handbook of multicriteria analysis
cites work: A survey of recent developments in multiobjective optimization
cites work: Multicriteria Optimization
cites work: Generalized convexity and vector optimization
cites work: Efficiency and generalized concavity
cites work: Q4857870
cites work: A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
cites work: A characterization of weakly efficient points
cites work: Degrees of Efficiency and Degrees of Minimality
cites work: Dual Characterization and Scalarization for Benson Proper Efficiency
cites work: Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems
cites work: Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
cites work: Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
cites work: A unified vector optimization problem: complete scalarizations and applications
cites work: Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
cites work: Pshenichnyi's theorem for vector minimization
cites work: Geometrical characterization of weakly efficient points
cites work: Characterizations of efficient points in convex vector optimization problems
cites work: A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
cites work: Q4443700
cites work: On characterizing the solution sets of pseudoinvex extremum problems
cites work: Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
cites work: On the cones of tangents with applications to mathematical programming
cites work: Optimization and nonsmooth analysis
cites work: Nonlinear Programming
cites work: Generalized monotonicity and convexity of non-differentiable functions
cites work: The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
cites work: Constrained qualifications in multiobjective optimization problems: Differentiable case
cites work: Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
cites work: Convexificators and strong Kuhn-Tucker conditions
cites work: Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
cites work: Necessary conditions for optimality of nondifferentiable convex multiobjective programming
cites work: On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
cites work: Convex Analysis
cites work: An improved definition of proper efficiency for vector maximization with respect to cones
DOI: 10.1007/S10898-014-0191-1
Recommended article: A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
Recommended article: Characterizations of efficient points in convex vector optimization problems
Recommended article: Efficient and weak efficient points in vector optimization with generalized cone convexity
Recommended article: Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
Recommended article: On the existence of weak efficient solutions of nonconvex vector optimization problems
Recommended article: On the properly efficient points of nonconvex sets
Recommended article: Vector critical points and cone efficiency in nonsmooth vector optimization
Recommended article: Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
Recommended article: 向量优化问题 (C,\varepsilon)-弱有效解的一种非线性标量化性质
Recommended article: Q4640401
description: scientific article; zbMATH DE number 6419110