局部凸空间中ic -锥-类凸集值优化问题的超有效性

该文研究局部凸空间中受集值约束的集值优化问题的超有效解. 证明了ic -锥-类凸集值映射的一个有用性质, 并以此性质为主要工具, 得到了ic -锥-类凸集值向量优化问题超有效解的最优性条件和鞍点定理.     

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

本文讨论生成锥内部凸-锥-类凸集值向量优化问题的超有效解.在生成锥内部凸-锥类凸假设下,建立了集值向量优化问题在超有效意义下的标量化、Lagrangian乘子和鞍点定理     

On super efficiency in set-valued optimization

The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperation theorem, Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions, the necessary conditions are obtained for the set-valued optimization problem to attain its super efficient solutions. Also, the sufficient conditions for Kuhn-Tucker＇s, Lagrange＇s and saddle points optimality conditions are derived.     

近似锥一次类凸集值向量优化问题强有效解的广义鞍点刻画

本文研究了近似锥一次类凸集值向量优化强有效解的广义鞍点表示问题.利用择一定理,得到了近似锥-次类凸集值优化问题强有效解为广义鞍点的充分条件和必要条件.所得结果丰富了集值优化理论,并且拓广了广义鞍点的应用.     

Minimax Problems for Set-Valued Mappings

In this article, by virtue of the Fan-Browder fixed point theorem, we first obtain a minimax theorem and establish an equivalent relationship between the minimax theorem and a cone saddle point theorem for scalar set-valued mappings. Then, by using scalarization functions, we investigate an existence theorem of the cone saddle point for set-valued mappings. Simultaneously, we also establish a minimax theorem for set-valued mappings.     

向量值映射锥鞍点存在定理

本文首次通过借助Kakutani-Fan-Glicksberg固定点定理和非线性标量化,研究了向量值映射的Benson锥鞍点定理.然后,通过使用该Kakutani-Fan-Glicksberg固定点定理,同样得到了集值映射的锥松鞍点定理.     

序线性空间中广义半似凸集值映射向量优化的Benson真有效性

在序线性空间中建立了广义半似凸集值映射的择一定理.利用向量闭包,引进了集值优化的Benson真有效解.在广义半似凸的假设下,获得了Benson真有效性意义下的标量化定理,Lagrangian乘子定理和鞍点定理.     

向量集值优化超有效解的对偶问题

借助于Contingent切锥和集值映射的上图而引入的有关集值映射的Contingent切导数，对约束集值优化问题的超有效解建立了最优性Kuhn Tucker必要及充分性条件,借此建立了向量集值优化超有效解的Wolfe型和Mond Weir型对偶定理.     

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.     

Loose saddle points of set-valued maps in topological vector spaces

We give a new existence theorem for loose saddle point of set-valued map having values in a partially ordered topological vector space which is based on continuity and quasiconvexity- quasiconcavity of its scalarized maps. Moreover, we prove a new saddle point theorem for vector-valued functions in locally convex topological vector spaces under weak condition that is the semicontinuity of two function scalarization.     

Minimax theorems for scalar set-valued mappings with nonconvex domains and applications

In this paper, by virtue of the separation theorem of convex sets, we prove a minimax theorem, a cone saddle point theorem and a Ky Fan minimax theorem for a scalar set-valued mapping under nonconvex assumptions of its domains, respectively. As applications, we obtain an existence result for the generalized vector equilibrium problem with a set-valued mapping. Simultaneously, we also obtain some generalized Ky Fan minimax theorems for set-valued mappings, in which the minimization and the maximization of set-valued mappings are taken in the sense of vector optimization.     

超有效元意义下集值优化的最优性条件

该文在Hausdorff局部凸拓扑向量空间考虑约束集值优化问题(SOP)在超有效意义下的Fritz John条件和Kuhn-Tucker条件.首先借助集值映射的下半可微的概念给出这种空间中集值映射导数的定义, 据此讨论了超有效元的Fritz John最优性条件.最后, 给出约束集值优化问题(SOP)取得超有效元的充分条件.     

集值映射多目标半定规划问题的epsilon-弱有效性

对于集值映射多目标半定规划问题, 在近似锥-次类凸的框架下, 建立了含矩阵和向量的择一性定理, 给出了问题的epsilon-弱有效解的epsilon-Lagrange乘子定理及标量化定理和epsilon-弱鞍点定理．     

Necessary conditions for super minimizers in constrained multiobjective optimization

This paper concerns the study of the so-called super minimizers related to the concept of super efficiency in constrained problems of multiobjective optimization, where cost mappings are generally set-valued. We derive necessary conditions for super minimizers on the base of advanced tools of variational analysis and generalized differentiation that are new in both finite-dimensional and infinite-dimensional settings for problems with single-valued and set-valued objectives.      

广义次似凸集值优化的鞍点定理

讨论广义次似凸集值优化的鞍点定理.给出广义次似凸集值映射的两个性质.定义广义次似凸集值优化的Fritz-John鞍点和Kuhn-Tucker鞍点.获得一系列广义次似凸集值优化的鞍点定理.     

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     

DEMICONTINUITY,GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS

Abstract

The aim of this paper is to establish the existence of loose saddle points for a set-valued map which is defined in a topological vector space and possesses the demicontinuity and generalized convexity. Our results strengthen several previously obtained results on the existence of saddle and loose saddle points for single- or set-valued maps.     

集值映射的对称向量拟均衡问题

研究向量集值映射的拟均衡问题的有效解,利用数值化方法与不动点定理,得到解的存在性定理.作为应用,得到广义向量鞍点,向量变分不等式与向量互补问题的存在性定理.     

On Ha＇s Version of Set-valued Ekeland＇s Variational Principle

By using the concept of cone extensions and Dancs-Hegedus-Medvegyev theorem, Ha [Some variants of the Ekeland variational principle for a set-valued map. J. Optim. Theory Appl., 124, 187–206 (2005)] established a new version of Ekeland’s variational principle for set-valued maps, which is expressed by the existence of strict approximate minimizer for a set-valued optimization problem. In this paper, we give an improvement of Ha’s version of set-valued Ekeland’s variational principle. Our proof is direct and it need not use Dancs-Hegedus-Medvegyev theorem. From the improved Ha’s version, we deduce a Caristi-Kirk’s fixed point theorem and a Takahashi’s nonconvex minimization theorem for set-valued maps. Moreover, we prove that the above three theorems are equivalent to each other.     

Super efficiency in convex vector optimization

We establish a Lagrange Multiplier Theorem for super efficiency in convex vector optimization and express super efficient solutions as saddle points of appropriate Lagrangian functions. An example is given to show that the boundedness of the base of the ordering cone is essential for the existence of super efficient points.Research is supported partially by NSERC.Research is supported partially by NSERC and Mount St. Vincent University grant.