带多面体控制锥的锥约束凸向量优化问题的有效解集的非空有界性的刻画

本文刻画了控制锥为多面凸锥的锥约束凸向量优化问题有效解集的非空有界性．然后将其中的一个重要条件应用于一类罚函数方法收敛性的研究．     

一类锥约束凸向量优化问题弱有效解集非空紧性的刻画和应用

本文研究当目标空间的控制结构为多面体锥时,锥约束凸向量优化问题的弱有效解集的非空紧性的刻画,然后将所获结果用于研究一类罚函数方法的收敛性.     

带多面体控制锥的锥约束凸向量优化问题的有效解集的非空有界性的刻画(英文)

本文刻画了控制锥为多面凸锥的锥约束凸向量优化问题有效解集的非空有界性.然后将其中的一个重要条件应用于一类罚函数方法收敛性的研究.     

自反Banach空间中向量优化问题弱有效解集特性的进一步研究

本文分别研究了在无限维自反Banach空间中,当控制结构为多面体锥时,-般凸向量优化问题和锥约束凸向量优化问题的弱有效解集的非空有界性,并且把结论应用到了一类罚函数方法的收敛性分析上.     

向量优化问题弱有效解集的非空性和紧性刻画

考虑有限维空间Rn(n＞1)中目标映射是仿凸锥映射的向量优化问题.通过对偶锥的端方向和标量函数的0-强制性给出了弱有效解集非空性和紧性的刻画.     

自反Banach空间中锥拟凸映射多目标最优化问题锥有效解集的弱连通性

本文在自反Banach空间中引进了锥弱连续映射和点集的弱连通概念．在讨论锥弱连续和锥拟凸映射以及锥最小上界的几个性质的基础上,证明了当象集为锥凸集时定义在自反Ba- nach空间中的有界闭凸集上的锥弱连续和锥拟凸映射多目标最优化问题的锥有效解集是弱连通的．     

锥拟凸与拓扑向量空间多目标最优化有效解集和弱有效解集的连通性

§1.引言多目标最优化的有效解集和弱有效解集的连通性问题,是多目标最优化研究中一个引入关注的重要课题.研究连通性的原因之一,是由于在多目标最优化的一些算法中,人们有时要依照某些辅助判据从解集中的一个解过渡到另一个解.这时,解集的连通性就能保证这种过渡始终是在所考虑的解集之中进行的.     

向量优化问题锥有效解的逼近

本文引进了一种新的锥的扩张方式,并对新的扩张锥和原来的锥的关系作了讨论,借助这种新的概念,在无限维空间中给出了向量优化问题的锥有效解的近似方法．     

赋范线性空间中锥拟凸向量优化问题超有效解集的连通性

本文研究赋范线性空间中集值映射向量优化问题超有效解集的连通性问题．证明了目标映射为锥拟凸的向量优化问题的超有效解集是连通的．     

Hausdorff空间中向量优化问题弱有效解的存在性定理

Hausdorff空间中关于向量优化问题弱有效解的一个存在性定理被给出,另外,举出一个反例说明Flores-Bazan和Vera所作的一个猜想是不成立的.     

Characterizations of the Nonemptiness and?Boundedness of Weakly Efficient Solution Sets of?Convex Vector Optimization Problems in Real Reflexive?Banach Spaces

Under a weak compactness assumption on the functions involved, which always holds in finite-dimensional normed linear spaces, this paper extends various characterizations of the nonemptiness and boundedness of weakly efficient solution sets of convex vector optimization problems, obtained previously by the author (Deng in J. Optim. Theory Appl. 96:123–131, 1998) in the real finite-dimensional normed linear space setting, to those in the real reflexive Banach space setting.     

Characterizations of the Nonemptiness and Compactness of Solution Sets in Convex Vector Optimization

In this paper, various necessary and sufficient conditions are given for the nonemptiness and compactness of the weakly efficient solution set of a convex vector optimization problem.     

Characterization of the Nonemptiness and Compactness of Solution Sets in Convex and Nonconvex Vector Optimization

As a consequence of an abstract theorem proved elsewhere, a vector Weierstrass theorem for the existence of a weakly efficient solution without any convexity assumption is established. By using the notion (recently introduced in an earlier paper) of semistrict quasiconvexity for vector functions and assuming additional structure on the space, new existence results encompassing many results appearing in the literature are derived. Also, when the cone defining the preference relation satisfies some mild assumptions (but including the polyhedral and icecream cones), various characterizations for the nonemptiness and compactness of the weakly efficient solution set to convex vector optimization problems are given. Similar results for a class of nonconvex problems on the real line are established as well.Research supported in part by Conicyt-Chile through FONDECYT 104-0610 and FONDAP-Matemáticas Aplicadas II.     

Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications

In this paper, we characterize the nonemptiness and compactness of the set of weakly efficient solutions of a convex vector optimization problem with cone constraints in terms of the level-boundedness of the component functions of the objective on the perturbed sets of the original constraint set. This characterization is then applied to carry out the asymptotic analysis of a class of penalization methods. More specifically, under the assumption of nonemptiness and compactness of the weakly efficient solution set, we prove the existence of a path of weakly efficient solutions to the penalty problem and its convergence to a weakly efficient solution of the original problem. Furthermore, for any efficient point of the original problem, there exists a path of efficient solutions to the penalty problem whose function values (with respect to the objective function of the original problem) converge to this efficient point.