Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps

This paper extends the concept of cone subconvexlikeness of single-valued maps to set-valued maps and presents several equivalent characterizations and an alternative theorem for cone-subconvexlike set-valued maps. The concept and results are then applied to study the Benson proper efficiency for a vector optimization problem with set-valued maps in topological vector spaces. Two scalarization theorems and two Lagrange multiplier theorems are established. After introducing the new concept of proper saddle point for an appropriate set-valued Lagrange map, we use it to characterize the Benson proper efficiency. Lagrange duality theorems are also obtained     

Stampacchia variational inequality with weak convex mappings

ABSTRACT

In this paper, the concept of weak convex set-valued mapping is introduced and various conditions for a set-valued mapping to be weak convex are given. Then, existence theorems for the Stampacchia variational inequality problem are established, when the involved mapping is weak convex.     

生成锥内部凸-锥-类凸集值优化问题的Henig真有效性

该文讨论局部凸空间中的约束集值优化问题. 首先, 在生成锥内部凸-锥-类凸假设下, 建立了Henig真有效解在标量化和Lagrange乘子意义下的最优性条件. 其次, 对集值Lagrange映射引入Henig真鞍点的概念, 并用这一概念刻画了Henig真有效解. 最后, 引入了一个标量Lagrange对偶模型, 并得到了关于Henig真有效解的对偶定理. 另外, 该文所得结果均不需要约束序锥有非空的内部.     

集值优化全局真有效解的最优性条件

本文引进集值映射的全局真有效次微分的概念,并用它得到了约束集值优化问题全局真有效解在集值映射的支撑函数和Lagrange乘子形式下的最优性必要条件.     

Superefficiency in Vector Optimization with Nearly Subconvexlike Set-Valued Maps

In the framework of locally convex topological vector spaces, we establish a scalarization theorem, a Lagrange multiplier theorem and duality theorems for superefficiency in vector optimization involving nearly subconvexlike set-valued maps.     

广义凸拓扑线性空间集值优化的ε-强有效解

在Hausdorff局部凸拓扑线性空间中考虑约束集值优化问题(VP)的ε-强有效性.在内部锥类凸假设下,利用凸集分离定理,分别建立了关于ε-强有效解的标量化定理和ε-Lagrange乘子定理.     

Characterizations of optimal solution sets of convex infinite programs

In this paper, several Lagrange multiplier characterizations of the solution set of a convex infinite programming problem are given. Characterizations of solution sets of cone-constrained convex programs are derived as well. The procedure is then adopted to a semi-convex problem with convex constraints. For this problem, we present firstly a necessary and sufficient condition for optimality and secondly a characterization of its optimal solution set, based on a Lagrange multiplier associated with a given solution and on directional derivatives of the objective function.      

Super efficiency in vector optimization with nearly convexlike set-valued maps

In this paper, we establish a scalarization theorem and a Lagrange multiplier theorem for super efficiency in vector optimization problem involving nearly convexlike set-valued maps. A dual is proposed and duality results are obtained in terms of super efficient solutions. A new type of saddle point, called super saddle point, of an appropriate set-valued Lagrangian map is introduced and is used to characterize super efficiency.     

Second-order Karush–Kuhn–Tucker optimality conditions for set-valued optimization

In this paper, we propose the concept of a second-order composed contingent derivative for set-valued maps, discuss its relationship to the second-order contingent derivative and investigate some of its special properties. By virtue of the second-order composed contingent derivative, we extend the well-known Lagrange multiplier rule and the Kurcyusz–Robinson–Zowe regularity assumption to a constrained set-valued optimization problem in the second-order case. Simultaneously, we also establish some second-order Karush–Kuhn–Tucker necessary and sufficient optimality conditions for a set-valued optimization problem, whose feasible set is determined by a set-valued map, under a generalized second-order Kurcyusz–Robinson–Zowe regularity assumption.     

A systematization of convexity and quasiconvexity concepts for set-valued maps,defined by l-type and u-type preorder relations

Abstract

In this paper, we study different classes of generalized convex/quasiconvex set-valued maps, defined by means of the l-type and u-type preorder relations, currently used in set-valued optimization. In particular, we identify those classes of set-valued maps for which it is possible to extend the classical characterization of convex real-valued functions by quasiconvexity of their affine perturbations.     

Characterizations of strictly convex sets by the uniqueness of support points

Abstract

This short paper characterizes strictly convex sets by the uniqueness of support points (such points are called unique support points or exposed points) under appropriate assumptions. A class of so-called regular sets, for which every extreme point is a unique support point, is introduced. Closed strictly convex sets and their intersections with some other sets are shown to belong to this class. The obtained characterizations are then applied to set-valued maps and to the separation of a convex set and a strictly convex set. Under suitable assumptions, so-called set-valued maps with path property are characterized by strictly convex images of the considered set-valued map.     

On vector variational-like inequalities and set-valued optimization problems

In this paper, some solution relationships between set-valued optimization problems and vector variational-like inequalities are established under generalized invexities. In addition, a generalized Lagrange multiplier rule for a constrained set-valued optimization problem is obtained under C-preinvexity.     

Henig Efficiency in Vector Optimization with Nearly Cone-subconvexlike Set-valued Functions

In this paper,we study Henig efficiency in vector optimization with nearly cone-subconvexlikeset-valued function.The existence of Henig efficient point is proved and characterization of Henig efficiencyis established using the method of Lagrangian multiplier.As an interesting application of the results in thispaper,we establish a Lagrange multiplier theorem for super efficiency in vector optimization with nearly cone-subconvexlike set-valued function.     

A Duality Theory for Set-Valued Functions I: Fenchel Conjugation Theory

It is proven that a proper closed convex function with values in the power set of a preordered, separated locally convex space is the pointwise supremum of its set-valued affine minorants. A new concept of Legendre–Fenchel conjugates for set-valued functions is introduced and a Moreau–Fenchel theorem is proven. Examples and applications are given, among them a dual representation theorem for set-valued convex risk measures.      

集值映射向量优化问题的ε—超有效解

本文引进了集值映射向量优化问题的ε－超有效解概念,并在集值映射为近似广义锥次似凸的假设下,建立了关于ε－超有效解的标量化定理和Lagrange乘子定理。     

Near-Subconvexlikeness in Vector Optimization with Set-Valued Functions

A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization.     

Maximization of lower semi-continuous convex functional on bounded subsets of locally convex spaces. II: Quasi-Lagrangian duality theorems

We prove, for a proper lower semi-continuous convex functional ? on a locally convex space E and a bounded subset G of E, a formula for sup ?(G) which is symmetric to the Lagrange multiplier theorem for convex minimization, obtained in [7], with the difference that for sup ?(G) Lagrange multiplier functionals need not exist. When ? is also continuous we give some necessary conditions for g₀ ∈ G to satisfy ?(g₀) = sup ?(G). Also, we give some applications to deviations and farthest points. Finally, we show the connections with the “hyperplane theorems” of our previous paper [8].     

\epsilon -Henig proper efficiency of set-valued optimization problems in real ordered linear spaces

The aim of this paper is to investigate \(\epsilon \) -Henig proper efficiency of set-valued optimization problems in linear spaces. Firstly, a new notion of \(\epsilon \) -Henig properly efficient point is introduced in linear spaces. Secondly, scalarization theorems of set-valued optimization problems are established in the sense of \(\epsilon \) -Henig proper efficiency. Finally, under the assumption of generalized cone subconvexlikeness, Lagrange multiplier theorems are obtained. Our results generalize some known results in the literature from topological spaces to linear spaces.     

集值映射向量优化问题的ε-超鞍点和ε-对偶定理

本文研究集值映射向量优化问题的ε-超鞍点和ε-对偶定理。在集值映射是近似广义锥次似凸的假设下，利用ε-超有效解的标量化和Lagrange乘子定理，建立和证明了关于ε-超有效解的鞍点和对偶定理。