Conjugate Maps,Subgradients and Conjugate Duality in Set-Valued Optimization

Using the concept of supremum/infimum of a set, defined in terms of the closure of the set, we introduce the notions of conjugate and biconjugate maps as well as that of subgradients of a set-valued map. Conjugate duality results are also established for a set-valued optimization problem.     

具集值映射的广义强向量拟均衡问题

讨论了一类具集值映射的广义强向量拟均衡问题（GSVQEP）解的存在性.利用连续选择定理和不动点定理,在没有任何单调性假设下得到了GSVQEP解的存在性定理.     

Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps

In this paper, we consider some dual problems of a primal multiobjective problem involving nonconvex set-valued maps. For each dual problem, we give conditions under which strong duality between the primal and dual problems holds in the sense that, starting from a Benson properly efficient solution of the primal problem, we can construct a Benson properly efficient solution of the dual problem such that the corresponding objective values of both problems are equal. The notion of generalized convexity of set-valued maps we use in this paper is that of near-subconvexlikeness.     

Convexity Criteria for Set-Valued Maps

The paper gives necessary and sufficient conditions for a set-valued map F between Banach spaces X and Y to be convex with respect to a convex cone KY These conditions are written in terms of the contingent derivative of the map      

集值映象的变分不等式

本文应用ＫｙＦａｎ定理和ＫＫＭ技巧在（局部凸）Ｈａｕｓｄｏｒｆｆ拓扑向量空间及自反Ｂａｎａｃｈ空间上讨论了集值映象的变分不等式解的存在性。所讨论的问题比［６，７，１０，１１］中讨论的更为广泛。     

Weak Subdifferential of Set-Valued Mappings

In this note we introduce a notion of the weak contingent generalized gradient for set-valued mappings associated with the contingent epiderivative of set-valued mappings introduced in "E. Bednarczuk and W. Song (1998). Contingent epiderivative and its applications to set-valued optimization. Control and Cybernetics, 27, 376-386; G.Y. Chen and J. Jahn (1998). Optimally conditions for set-valued optimization problems. Mathematical Methods of Operations Research, 48, 187-200." and prove that, under some additional condition, it coincides with the weak subdifferential introduced in "T. Tanino (1992). Conjugate duality in vector optimization. Journal of Mathematical Analysis and Applications, 167, 84-97." when the set-valued map is cone-convex. We also study the weak contingent generalized gradient of a sum of two set-valued mappings and optimality conditions for a set-valued vector optimization problem.     

Weak Subdifferentials for Set-Valued Mappings

The purpose of this paper is to study the weak subdifferential for set-valued mappings, which was introduced by Chen and Jahn (Math. Methods Oper. Res., 48:187–200, 1998). Two existence theorems of weak subgradients for set-valued mappings are obtained. Moreover, some properties of the weak subdifferential for set-valued mappings are derived. Our results improve the corresponding ones in the literature. Some examples are given to illustrate our results.     

On the Strong Convergence of Subgradients of Convex Functions

In this paper, results on the strong convergence of subgradients of convex functions along a given direction are presented; that is, the relative compactness (with respect to the norm) of the union of subdifferentials of a convex function along a given direction is investigated.     

Conic Set-Valued Maps in Vector Optimization

The paper deals with the properties of a conic set-valued function defined on the set of all ideal points of vector programming problems. The results here about the continuity and derivability of this conic set-valued map, can be used to get information about the sensitivity of the problem and the stability of the order associated to every ideal point. Furthermore, it is proved that certain contingent cones are determined by the ideal conic set-valued map.      

Porosity and Fixed Points of Nonexpansive Set-Valued Maps

We study the existence problems of fixed points and the topological structure of fixed point sets for nonexpansive set-valued maps in Banach space. We establish some porosity results on the existence of fixed points and the topological structure of fixed point sets for nonexpansive set-valued maps with values in an admissible family. The results obtained in the present paper cover and improve the corresponding ones due to De Blasi and Myjak (C. R. Acad. Sci. Paris Sér. I Math. 308:51–54, 1989) and De Blasi et al. (Set-Valued Anal. 17:97–112, 2009).     

锥凸集值映射的基本性质

本文首先在R~m的幂集上定义了一种锥序关系并借助这种序关系定义锥凸集值映射,证明了普通单值凸函数的一些基本性质拓广到这种锥凸集值映射时仍成立.     

First and Second-Order Lagrange Claims for Set-Valued Maps

In this note, we derive first and second-order necessary (resp. sufficient) conditions for local minimum (resp. strict local minimum) points of optimization problems governed by set-valued maps. This allows us to present and to solve a generalized Lagrange claim in a multivalued setting.     

Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems

This paper gives several characterizations of nearly subconvexlike set-valued maps (see Ref. 1) and shows that a weakly efficient solution and a Benson properly efficient solution of a vector optimization problem with nearly-subconvexlike objectives and constraints can be expressed in terms of saddle points defined in a suitable sense.     

On Vector Quasi-Equilibrium Problems with Set-Valued Maps

In this paper, we introduce a new class of vector quasi-equilibrium problems with set-valued maps. Almost all the vector equilibrium models of the Blum-Oettli type in the literature are special cases of our new class of equilibrium problems under consideration. Moreover, a number of C-diagonal quasiconvexity properties are proposed for set-valued maps, which are natural generalizations of the -diagonal quasiconvexity for real functions. Together with an application of continuous selection and fixed-point theorems, these conditions enable us to prove unified existence results of solutions for such vector equilibrium problems.     

Theorems of the Alternative and Optimization with Set-Valued Maps

In this paper, the concept of generalized cone subconvexlike set-valued mapsis presented and a theorem of alternative for the system of generalizedinequality–equality set-valued maps is established. By applying thetheorem of the alternative and other results, necessary and sufficientoptimality conditions for vector optimization problems with generalizedcone subconvexlike set-valued maps are obtained.     

集值映射的Epi-导数及其应用

在本文里，集值映射的Epi-导数被引入，它可以认作是实值Lipschitz函数的Clarke-广义方向导数的推广，同时它的一些性质也被研究．进一步地，利用这个Epi-导数集值映射的次微分被定义并研究它的性质．作为其应用，我们给出了集值优化问题的一些(必要或充分)最优性条件．     

Variational-Like Inequality Problems Involving Set-Valued Maps and Generalized Monotonicity

The aim of this paper is to establish existence results for some variational-like inequality problems involving set-valued maps, in reflexive and nonreflexive Banach spaces. When the set K, in which we seek solutions, is compact and convex, we no dot impose any monotonicity assumptions on the set-valued map A, which appears in the formulation of the inequality problems. In the case when K is only bounded, closed, and convex, certain monotonicity assumptions are needed: We ask A to be relaxed η-α monotone for generalized variational-like inequalities and relaxed η-α quasimonotone for variational-like inequalities. We also provide sufficient conditions for the existence of solutions in the case when K is unbounded, closed, and convex.     

Periodic Trajectories and Coincidence Points of Tuples of Set-Valued Maps

A fixed-point theorem is proved for a finite composition of set-valued Lipschitz maps such that the product of their Lipschitz constants is less than 1. The notion of a Lipschitz tuple of (finitely many) set-valued maps is introduced; it is proved that such a tuple has a periodic trajectory, which determines a fixed point of the given composition of set-valued Lipschitz maps. This result is applied to study the coincidence points of a pair of tuples (Lipschitz and covering).