Some minimax problems of vector-valued functions

The concepts of cone extreme points, cone saddle points, and cone saddle values are introduced. The relation of inclusion among the sets mini _xX max _yY f(x, y), maxi _yY min _xX f(x, y), and the set of all weak cone saddle values is investigated in the case where the image space ⁿ off is ordered by an acute convex cone.The author is grateful for the useful suggestions and comments given by Prof. K. Tanaka, Niigata University, Niigata, Japan.The author would like to thank the referees for their valuable suggestions on the original draft.     

赋范线性空间中包含方程可解性定理的推广及弱切锥的应用

本文首先在一般的赋范线性空间中研究了集值映射F;X→Y的平衡点的存在性问题,证明了包含问题O∈F(X)的三个可解性定理.然后在无穷维空间中研究了弱相依锥T_k^σ(x)的直接像,弱相依导数D^σF(x,y)的一个链式法则以及偏y弱导数D_y^σF(x,y)的弱Lip连续性.最后,作为应用,给出并证明了用弱相依导数D^σF(x,y)及弱P导数P^σF(x,y)判定无穷维     

On cone characterizations of weak, proper and Pareto optimality in multiobjective optimization

Efficient, weakly and properly Pareto optimal solutions of multiobjective optimization problems can be characterized with the help of different cones. Here, contingent, tangent and normal cones as well as cones of feasible directions are used in the characterizations. The results are first presented in convex cases and then generalized to nonconvex cases by employing local concepts.     

同伦方法求解非凸区域Brouwer不动点问题

本文构造了一个新的求解非凸区域上不动点问题的内点同伦算法,并在弱法锥(见定义2．1(2))和适当的条件下,证明了算法的全局收敛性．本文所给的条件比外法锥条件更加一般．     

有效点、弱有效点和真有效点的锥刻画

利用集合在某点的相依切锥、法向锥和可行方向锥等研究向量优化问题的有效点、 弱有效点和真有效点的特征,对局部有效点、局部弱有效点和局部真有效点与集合的各 锥之间的关系作了刻画.     

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

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

弱拟法锥条件下非凸优化问题的同伦算法

本文给出弱拟法锥条件的定义,并针对非线性组合同伦方程,得到在弱拟法锥条件下求解约束非凸优化问题的同伦内点算法.证明了该算法对于可行域的某个子集中几乎所有的点,同伦路径存在,并且同伦路径收敛于问题的K-K-T点,通过数值例子验证了该算法是有效的.     

Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

In this study, the Dubovitskii-Milyutin type optimization theory is extended to multiobjective programs in a locally convex linear topological space, producing necessary conditions for a weak Pareto optimum. In the case of an ordinary multiobjective convex program, generalized Kuhn-Tucker conditions by a subdifferential formula are necessary and sufficient for a weak Pareto optimum.The author is grateful for the useful suggestions and comments of Professor N. Furukawa and the referee.     

集值优化导数型最优性条件

借助于相依上导数的概念,建立了锥次类凸集值映射的导数型择一性定理,并利用择一性定理获得了集值优化导数型的最优性必要条件和充分条件.     

Weak sharp minima revisited, part II: application to linear regularity and error bounds

The notion of weak sharp minima is an important tool in the analysis of the perturbation behavior of certain classes of optimization problems as well as in the convergence analysis of algorithms designed to solve these problems. It has been studied extensively by several authors. This paper is the second of a series on this subject where the basic results on weak sharp minima in Part I are applied to a number of important problems in convex programming. In Part II we study applications to the linear regularity and bounded linear regularity of a finite collection of convex sets as well as global error bounds in convex programming. We obtain both new results and reproduce several existing results from a fresh perspective. We dedicate this paper to our friend and mentor Terry Rockafellar on the occasion of his 70th birthday. He has been our guide in mathematics as well as in the backcountry and waterways of the Olympic and Cascade mountains. Research supported in part by the National Science Foundation Grant DMS-0203175.     

Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

Several corrections to Ref. 1 are pointed out.     

Generalization of the Dubovitzky-Milutyn optimality conditions

Various types of conical approximation of sets are discussed. The notions of an external cone and an internal cone result in a strengthened separation theorem. Based on this theorem, some generalizations of the Dubovitzky-Milutyn optimality conditions are given.This research was sponsored by the Institute of Automatic Control, Department of Electronics, Technical University, Warsaw, Poland.     

具有Banach代数的锥D-度量空间和公共不动点定理

为了拓展不动点理论,本文提出具有Banach代数的锥D-度量空间的定义,然后在删去锥的正规性的条件下,通过构造迭代序列,研究此空间中相容映象的公共不动点的存在性和唯一性问题,得到两个新的公共不动点定理,其结果改善和推广了现有文献中的一些主要结论.     

Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems

By using the concepts of local cone approximations and K-directional derivatives, we obtain necessary conditions of optimality for the weak efficiency of the vectorial optimization problems with the inequalities and abstract constraints. We introduce the notion of stationary point (weak and strong) and we prove that, under suitable hypotheses of K-invexity, the stationary points are weakly efficient solutions (global).     

半无限规划的一个对偶问题

本文对半无限凸规划提出一个新的对偶问题，使用扰动函数、次微分和法锥，文中证明了相应的弱对偶性及强对偶性的充要条件．     

Characterization of the Cone of Attainable Directions

A useful characterization of the cone of attainable directions is provided.This research was partially supported by the Ministerio de Ciencia y Tecnología (Spain), Project BFM2003-02194.     

An LMI description for the cone of Lorentz-positive maps II

Let L _n be the n-dimensional second-order cone. A linear map from ? ^m to ? ⁿ is called positive if the image of L _m under this map is contained in L _n . For any pair (n,?m) of dimensions, the set of positive maps forms a convex cone. We construct a linear matrix inequality of size (n???1)(m???1) that describes this cone.     

向量映射的鞍点和Lagrange对偶问题

本文研究拓扑向量空间广义锥-次类凸映射向量优化问题的鞍点最优性条件和Lagrange对偶问题,建立向量优化问题的Fritz John鞍点和Kuhn-Tucker鞍点的最优性条件及其与向量优化问题的有效解和弱有效解之间的联系。通过对偶问题和向量优化问题的标量化刻画各解之间的关系,给出目标映射是广义锥-次类凸的向量优化问题在其约束映射满足广义Slater约束规格的条件下的对偶定理。