凸点

Star pattern identification algorithm based on convex polygon with star magnitudes-independent is presented for strap-down celestial guidance.

依其坐标排序，采用由平面上的点生成凸多边形的算法，就能得到唯一的、以恒星为顶点的凸多边形。

By level function,ε-subdifferential, normal cone and dual function, global optimal solutions for a convex function in locally convex topological vector space and a few of equivalent forms on it are obtained. Maximum points are characterized.

讨论局部凸拓扑向量空间中凸函数的全局最优解，用水平函数、ε-次微分及法向锥和共轭函数等工具刻画其最大值点，得到最优解的几个等价形式。

Using the method of approximating the Lipschitz functions by the convex functions, we give a sufficient condition for the set where Lipschitz functions on a Hilbert space are Frechet differentiable is a residual set.

我们利用Lipschitz函数空间中凸函数的逼近性质来分析Lipschitz函数的微分性质，得到Hilbert空间上Lipschitz函数的Frechet可微点集是剩余集的一个充分条件，以标题"Lipschitz函数与凸函数之间的一些联系"在中国科学杂志上发表。

A new SVM is presented in this paper to solve the approximately linear separable problem of pattern recognition:First,we transform the two convex hulls which are made up of the approximately separable training set to make them separable;Second,we can figure out a separating hyperplane by halving the nearest points method or maximal margin method;Then,we get the approximately linear SVM by solving the dual problem of maximal margin method.

对模式分类中的近似线性可分问题提出了一种新的近似线性支持向量机：先对近似线性分类中的训练集所形成的两类凸壳进行了相似变形，使变形后的凸壳线性可分，再用平分最近点和最大间隔法求出理想的分划超平面，然后再通过求解最大间隔法的对偶问题得到基于相似压缩的近似线性SVM。

In order to study vector-valued optimization problem, in chapter 5, a class of vector -valued function, that is, uniformly same-order set-valued function is introduced , which includes the separated functions as its proper subset; without hypothesis of convexity, new minimax theorem and saddle point theorem for uniformly same-order set-valued function are established. Next, by employing Ky Fan\'s lemma and H-KKM mapping , several existence results for generalized vector equilibrium problem established.

为了研究向量优化问题，作为可分函数的推广，第五章引入了一致同阶集值函数类，在没有凸性条件的假设下，对一致同阶集值函数建立了新的极小极大定理与鞍点存在定理；利用H-KKM映射，对一般向量均衡问题建立了(来源：A73BcbC论文网www.abclunwen.com)几个存在性定理；最后讨论了集值向量均衡问题系统，利用集值映射的拟凸性，在较弱的条件下证明了解的存在性。

In the framework of separable locally convex metric spaces, we give scalarization theorems on Benson proper efficiency and study Benson proper efficient solutions of vector optimization problems involving nearly subconvexlike set-valued maps.

中文摘要：本文在可分局部凸距离空间的框架下，给出了Benson真有效点的标量化定理，并研究了几乎次类凸集值映射向量优化问题的Benson真有效解。

The existence theorem of generalized weak efficient solutions with respect to variable, cone for a linear G〓teaux differentiable mapping is proved with set valued mapping fixed-point theorem and the relation between a vector optimization and a variational inequality problem. The existence of weak efficient solutions for multi-objective convex vector optimization is characterized.

建立映射在线性G〓teaux可微条件下关于可变锥的广义弱有效解的存在性及多目标凸向量优化问题在G〓teaux可微条件下弱有效解的特征，利用集值映射不动点定理及向量优化与变分不等式的关系证明线性G〓teaux可微锥凸映射关于可变锥的广义弱有效解的存在性定理。

We avoid of assuming that the interior of the ordering cone is not empty and the cone has a compact base or a weakly compact base, but consider Benson proper efficiency in the framework of sparable locally convex metric spaces.

本文回避了以往需要序锥内部非空并且有紧基或弱紧基的条件，转而把目光从局部凸拓扑向量空间投向可分局部凸距离空间，在这个框架下，先利用Polarity定理给出了Benson真有效点的标量化定理。

By applying a Fan-Glicksberg type fixed point theorem for upper semicontinuous set-valued mappings with closed acyclic values and a maximum theorem,several existence theorems of weighted Nath-equilibria and Pareto equilibria for the constrained multiobjective games are proved in noncompact locally convex H-spaces.

应用局部凸H－空间内具有闭零调值的上半连续集值映象的Fan－Glicksberg型不动点定理和极大化定理，对无限最优化总理2和约束对策问题在没有线性结构的局部凸H－空间内证明了解的某些新的存在定理，这些定理改进和推广了最近文献中的许多重要结果。

The traditional convex hull algorithms of point set and that of simple polygons have parallelly developed without any combination.

传统点集凸包算法和简单多边形凸包算法平行发展，互不相干。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。