凸点

Especially an elongated boss at the junction of the intersect ing ribs of the fan vaulting associated with the English Perpendicular style.

尤其是指与英国垂直式风格有关的一种扇形拱顶的交叉拱肋在接合点的拉长浮凸饰。

In complete convex metric spaces , we use Ishikawa iterative process to approximate common fixed point of quasi - contractive mapping pair.

在完备凸度量空间中，运用广义的Ishikawa迭代序列列逼近拟压缩映射对的公共不动点。

However, there has been hardly any result for computing fixed point problem in general nonconvex subsets.

对于非凸集上的不动点问题，一直没有相应的结果。

For a class of generalized fractional programming whose objective function is composed of infinite fractions,the saddle-point type optimality criteria are proven by using the existing necessary conditions,under the assumption of the class of B--invexity.

对于一类目标函数中有无限个分式的广义分式规划，给出一个不完全Lagrange函数，并利用已有的最优性必要条件，在B--不变凸性的条件下，证明了鞍点最优性准则。

The notions of move generalized quasi-contractive mapping sequence respect to p and generalized Ishikawa-type iteration are introduced in p-convex metric space s.

在p-凸度量空间内，引入关于p的更广义拟压缩映射序列和广义Ish ikawa型迭代序列，证明了广义Ish ikawa型迭代序列收敛于关于p的更广义拟压缩映射序列的唯一公共不动点。

The author defines the lshikawa iteration process with errors for a sequence nonlinear generalized quasi contractive mapping in convex metric space s and prove that the iterative scheme converges to the unique common fixed point of the sequence of nonlinear generalized quasi contractive mapping.

在凸度量空间内，对非线性广义拟压缩映射序列定义了带误差的 lshikawa迭代序列，证明了带误差的 lshikawa迭代序列收敛于非线性广义拟压缩映射序列的唯一公共不动点。

An modified BFGS algorithm to solve the unconstrained optimization, whose Hessian matrix of the minimum point of the convex function is rank one defect, is presented in this paper.

本文对凸函数在极值点的Hessian矩阵是秩亏一的情况下，给出了一类求解无约束优化问题的修正BFGS算法。

An modified BFGS algorithm o solve the unconstrained optimization, whose Hessian matrix of the minimum point of the convex function is rank one defect, is presented in this paper.

本文对凸函数在极值点的Hessian矩阵是秩亏一的情况下，给出了一类求解无约束优化问题的修正BFGS算法。

And then fuzzy least square support vector machines are proposed based on support vector domain description. Data samples in the feature space are described and the smallest enclosing hypersphere is obtained. The fuzzy membership value to each sample point is determined according to the distance of each sample from the center of the hypersphere, which can reduce the effect of outliers.

该方法先对样本进行数据域描述得到一个包含该组数据的最小半径的超球，再根据特征空间中样本与超球球心的距离确定它们的隶属度，减少了奇异点的影响；把所要求解的约束凸二次优化问题转化为正定线性方程组，并采用快速Cholesky分解的方法求解该方程组。

The algorithm avoids the test of point of intersection.

该算法不但避免了所有的交点测试，而且使得新加入点与凸壳边的平均比较次数不大于4，从而实现了高效的三角剖分。

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.

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