查询词典 global convergence

At the beginning of this paper, we briefly introduced the fundamental knowledge of the Newton iterative methods , and the local convergence theorem which extended the classical Newton method, because of the local convergence, the theorem had its certain restrict. Large-scale convergence theorem was proved under the condition that matrix M is irreducible diagonally dominant by Newton's method with line search.At the last part of this paper, we present the method for solving linear complementarity problems arising from journal bearings.

本文首先介绍了Newton型迭代法的基础知识，然后着重介绍了B-可微方程的Newton法，给出B-可微法的局部收敛结论，推广了古典的Newton法，但由于收敛的局部性，该算法仍有一定的不足之处；文章在证明大范围收敛定理时，假设M是不可约对角优势矩阵，采用一维Newton寻查的方法，保证算法的收敛性。

Limit theorems for the integration of function sequence with respect to weak convergence probability measure sequence are proved under the condition of the weak tight, which have been used to research the some convergence of expectant functional sequence,and a sufficient condition for the epi-convergence of expectant functional sequence is obtained.

提出了弱胎紧的概念，并在弱胎紧的条件下证明了函数序列关于弱收敛概率测度序列积分的极限定理，用其研究了期望泛函序列的若干收敛性，得到了期望泛函序列的、上图收敛的一个充分条件。

Experiment in this paper validates the convergence of the improved Mean Shift algorithm, contrast convergence rate of improved Mean Shift algorithm with convergence rate of traditional Mean Shift algorithm.

本文的实验也进一步验证了改进的Mean Shift算法的收敛性，并对比了改进前后的Mean Shift算法的收敛速度。

In this paper, the imprecise proofs existing in some literatures are firstly pointed out. Then, the local convergence is proved in a new way and the condition of convergence to the local maximum point is offered. Finally, the geometrical counterexamples are provided for explanation about convergence of Mean Shift and the conclusion is further discussed.

首先指出了Comaniciu和李乡儒的证明过程存在错误；然后，从数学上重新证明了Mean Shift算法的局部收敛性，并指出其收敛到局部极大值的条件；最后，从几何上举反例分析了Mean Shift的收敛性，并进行了深入比较和讨论。

Missirlis in article [1]. At the same time, a sufficient condition for convergence of the PSD method is given to be compared when the coefficient matrix A of the linear system Ax = b is a symmetric, positively defective matrix. In §3.2, an example is given to state that the range of our sufficient condition is wider than theorem 3.3 of article [1]. On the other hand, following a.n analogous approach of [14] and starting the functional relationshipwe have a perfect analysis for the PSD method to converge and optimum valves for the involved parameters under different conditions.Under the assumptions that A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are real,we get necessary and sufficient conditions for the PSD method to convergence.The result is equal to theorem 1 of article [9].Under the same condition, we can see the optimal parameter and of corresponding spectral radius of thePSD method in [8]:(2)When A is a consistent ordered matrix with nonvanishing diagonal elements and the eigenvalues of the Jacobi matrix of A are imaginary or zero,we get necessary and sufficient conditions for the PSD method to convergence.In chapter 3, the optimal parameter and of corresponding spectral radius of the PSD method are given by table 3.3. Moreover, under the assumption 0

Missirlis在文献[1]中定理3.3的不准确，同时给出了当线性方程组Ax=b的系数矩阵A为对称正定阵时，PSD迭代法收敛的一个充分条件与之比较，并且在§2.3中用实例说明了对于一部分矩阵而言本文得到的充分条件广于[1]中定理3.3的充分条件；另一方面，按照文献[14]的方法，我们从PSD迭代法的特征值λ与其Jacobi迭代矩阵B的特征值μ的关系式：出发，在不同条件下对PSD迭代法的收敛性和最优参数以及最优谱半径进行了完整的分析：(1)在系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为实数的条件下，给出了PSD迭代法收敛的充分必要条件，此结果与[9]中的定理1等价，此时最优参数及最优谱半径由[8]得：(2)第三章表3.3中给出了，当系数矩阵A为(1，1)相容次序矩阵且对角元全不为零，其Jacobi迭代矩阵B的特征值全为纯虚数或零时的PSD迭代法的收敛范围和最优参数，并且我们可以得到当0

The projection gradient method will be a possible way to solve the problem that we just get. It has been shown that the projections of the every directions, of which is the boundary point in linear restraint problems, are the possible decent directions, and the projection of negative grads direction is a decent direction. In 1960, Rosen proposed the basic idea of projection gradient methods, and then lots of researchers have been tried to find the convergence of this method. But most of them get the convergence with the condition to amend the convergence itself.

在约束最优化问题的算法中怎样寻找有效的下降方向是构造算法的重要内容，在寻找下降方向方面可行方向法中的投影梯度法有效的解决了下降方向的寻找问题，利用线性约束问题边界点的任意方向在边界上的投影都是可行方向，而负梯度方向的投影就是一个下降方向。60年代初Rosen提出投影梯度法的基本思想，自从Rosen提出该方法以后，对它的收敛性问题不少人进行了研究，但一般都是对算法作出某些修正后才能证明其收敛的，直到最近对Rosen算法本身的收敛性的证明才予以解决。

First,we proposes the acceleration of Monte Carlo EM Algorithm,which is based on Monte Carlo EM Algorithm and Newton-Raphson algorithm,to improve the convergence rate;Second,the it is shown that the accelerated EM algorithm we proposed has quadratic convergence rate in a neighborhood of the posterior mode;Finally,its excellent performance in convergence rate is illustrated by a classical example.

受Monte Carlo EM算法与EM加速算法启发，本文构造了一种新的EM算法，称为Monte Carlo EM加速算法；证明了该算法在似然函数/后验分布的众数的附近确实具有二次收敛速度，改进了Monte Carlo EM算法的收敛速度；并通过一个数值例子的计算结果说明了该算法的优良性，它兼具实现简单及收敛速度快的特点。

On this basis, according to historical data, apply ANN and differential simulation method to get the quantitatively correlative relations between each production and its own influence factors, and introduce the new methods of prediction for dynamic indexes with gas-field development (The combinatorial prediction method based on fuzzy comprehensive evaluation, the method of ANN to select optimally combinatorial prediction models and the ANN prediction method based on genetic algorithm).(2) Base on mathematical programming, combine with quantitative economics and techno-economics, introduce economical indexes to establish production"s distribution optimal model, production"s constitution optimal model and measured production"s constitution optimal model, including multi-objective models and five-years models. Upon this, the optimal project for all gas field and each gas-collected factory can be got. Also, introduce the time value of capitals to improve on these models.(3) Base on the optimal solution theory and algorithm theory for the nonlinear programming problem, introduce the SUMT algorithm and genetic algorithm to study how to solve the models, and on the basis of normal genetic algorithm, make use of auto-adaptively modulating method to improve on normal genetic algorithm; Base on algorithm"s convergence theory and calculation"s complexity theory to analyze seriatim SUMT algorithm"s convergence and genetic algorithms convergence, and compare performance with each other.

在此基础上，利用神经网络方法和微分模拟方法根据历史数据得到各分项产量与其影响因素之间的定量关联关系，并引入气田开发动态指标新的预测方法(基于模糊综合评判的组合预测方法、神经网络优选组合预测模型预测方法以及基于遗传优化的神经网络预测方法)；(2)以数学规划为基础，结合数量经济学和技术经济学，引入经济指标建立产量分配优化模型、产量构成优化模型、措施产量构成优化模型、气田开发多目标规划模型以及五年规划模型，进而获得全气田及各采气厂的最优方案，并引入资金时间价值对五年规划模型进行改进；(3)以非线性规划问题的最优解及算法理论为基础，引入SUMT算法以及遗传算法对模型的求解进行研究，并在原有的遗传算法基础上，引入自适应调整方法对遗传算法进行改进；以算法的收敛性理论和计算复杂性理论为基础，逐一分析SUMT算法以及遗传算法的收敛性，并比较三种算法的优劣性。

Chapter 2 investigates the convergence of triple and n -ple Dirichlet series, the convergence of triple random Dirichlet series under certain conditions, and the convergence of double bi-random Dirichlet series under the conditionand obtains some results similar to double Dirichlet series.

此外还在条件 sum from m=1 to +∞ sum from n=0 to +∞ P{|X_|≥m~pn~p}＜+∞下，研究了二重双随机Dirichlet级数的收敛性，得到了一些类似于二重Dirichlet级数的有关结论。

This paper first gives a continuous function, convergence, uniform convergence of function series, such as the definition of the concept, let us on the continuity and with the convergence of the initial understanding.

摘 要：本文首先给出函数连续性、收敛性、函数项级数一致收敛等概念的定义，让我们对连续性与收敛性有了初步的了解。

Article 144 The Government of the Hong Kong Special Administrative Region shall maintain the policy previously practised in Hong Kong in respect of subventions for non-governmental organizations in fields such as education, medicine and health, culture, art, recreation, sports, social welfare and social

第一百四十四条香港特别行政区政府保持原在香港实行的对教育、医疗卫生、文化、艺术、康乐、体育、社会福利、社会工作等方面的民间团体机构的资助政策。原在香港各资助机构任职的人员均可根据原有制度继续受聘。

Small wonder, then, that the Chinese spend more in the shop than any other group of foreign visitors do .

这样的小惊喜，使中国顾客比任何国家的人消费得更多。