集值映射的一种锥凸性及标量化

在一种集合偏序关系下提出了集值映射的标量锥拟凸概念, 讨论了它与各种锥凸性的关系. 然后对恰当锥拟凸性得到了某种水平集意义下的刻画. 同时建立了集值映射的各种锥凸性通过实值单调增加凸函数表示的标量化复合法则. 最后给出了利用Gerstewitz泛函表示的对集值映射的锥拟凸性的标量化刻画.     

锥-拟凸集值映射的标量刻画[英文]

利用非零连续线性泛函和Gerstewitz非线性标量函数,本文主要获得如下结论:集值映射的锥-拟凸性可以由实值函数的拟凸性完全刻画.本文所得结果改进了已有文献中的相应结果.     

锥凸集值映射的基本性质

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

锥拟凸集值映射与集值映射的锥半连续性

本文借助锥界集定义了一种新的锥拟凸集值映射,并且利用广义Minkowski泛函讨论了锥半连续及锥外上半连续集值映射的锥拟凸性．     

锥拟凸集值映射多目标优化的解集的连通性

在一般拓扑向量空间中,本文引进了一类锥进凸（锥严格拟凸）集值映射。并在目标映射是锥拟凸（锥严格拟凸）和上半连续的条件下,利用Minkowski泛函,证明了弱有效解（有效解）集是连通的。文[9]中的结论是本文所得结果大目标映射为单值和拓扑空间为格的情况下的特例。     

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

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

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

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

内部锥-凸集值映射Henig有效性的Morea-Rockafellar定理

本文利用集值映射弱次梯度的Morea-Rockafellar定理,在内部(锥)-凸性假设下,得到了集值映射关于Henig有效性的Morea-Rockafellar定理.其结论为:在内部(锥)-凸条件下,两个集值映射和的Henig有效次梯度可以表示成它们Henig有效次梯度的和.     

方向导数和广义锥-预不变凸集值优化问题

讨论拓扑向量空间中无约束集值优化问题的最优性条件问题.利用集值映射的Dini方向导数,在广义锥-预不变凸性条件下,建立了集值优化问题关于弱极小元和强极小元的最优性充分必要条件.     

Generalized convex set-valued maps

The aim of this paper is to show that under a mild semicontinuity assumption (the so-called segmentary epi-closedness), the cone-convex (respectively, cone-quasiconvex) set-valued maps can be characterized in terms of weak cone-convexity (respectively, weak cone-quasiconvexity), i.e., the notions obtained by replacing in the classical definitions the conditions of type “for all x,y in the domain and for all t in ]0,1[…” by the corresponding conditions of type “for all x,y in the domain there exists t in ]0,1[….”     

Super efficient solutions for set-valued maps

Some properties for K-preinvex set-valued maps in terms of normal subdifferential are obtained. Furthermore, some sufficient conditions for existence of super minimal points and necessary optimality conditions for a general kind of super efficiency are established.     

Approximation of continuous set-valued maps by constant set-valued maps with image balls

It is shown that the problem of the best uniform approximation in the Hausdorff metric of a continuous set-valued map with finite-dimensional compact convex images by constant set-valued maps whose images are balls in some norm can be reduced to a visual geometric problem. The latter consists in constructing a spherical layer of minimal thickness which contains the complement of a compact convex set to a larger compact convex set.     

Approximate solutions and scalarization in set-valued optimization

Abstract

Certain notions of approximate weak efficient solutions are considered for a set-valued optimization problem based on vector and set criteria approaches. For approximate solutions based on the vector approach, a characterization is provided in terms of an extended Gerstewitz’s function. For the set approach case, two notions of approximate weak efficient solutions are introduced using a lower and an upper quasi order relations for sets and further compactness and stability aspects are discussed for these approximate solutions. Existence and scalarization using a generalized Gerstewitz’s function are also established for approximate solutions, based on the lower set order relation.     

Nonconvex scalarization in set optimization with set-valued maps

The aim of this work is to obtain scalar representations of set-valued optimization problems without any convexity assumption. Using a criterion of solution introduced by Kuroiwa [D. Kuroiwa, Some duality theorems of set-valued optimization with natural criteria, in: Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis, World Scientific, River Edge, NJ, 1999, pp. 221-228], which is based on ordered relations between sets, we characterize this type of solutions by means of nonlinear scalarization. The scalarizing function is a generalization of the Gerstewitz's nonconvex separation function. As applications of our results we give two existence theorems for set-valued optimization problems.     

Some useful set-valued maps in set optimization

In this article, we introduce several classes of set-valued maps which can be useful in set optimization due to their applications. Exactly, we present some set-valued maps defined by scalar and vector functions and study their properties such as continuity and convexity among others. In addition, we compute their asymptotic maps which can be employed to establish coercivity and existence results in the framework of set optimization problems. Finally, we expose some possible directions for further research.     

On single-valuedness of convex set-valued maps

It is proved that ifX andY are linear spaces andF :X p(Y) is a set-valued map with convex graph such thatF(x) Ø for allx X andF(x ₀) is a singleton for somex ₀, thenF is single-valued and affine. Applications to metric projections and to adjoints of set-valued maps are given.Supported by NSF Grant DMS-9100228.The main result of this paper has been obtained while the second author was visiting the Pennsylvania State University in the framework of the exchange agreement between the Romanian Academy and the National Academy of Sciences of the U.S.A.     

Connectedness of super efficient solution sets for set-valued maps in Banach spaces

In this paper, we study the connectedness of the super efficient solution sets in convex vector optimization for set-valued maps in Banach spaces.