查询词典 quadratic convergence

Secondly, a rule of the choice of step-length is presented for a non-quadratic objective function of n variables, according to the rule we prove that the Gradient Method has local n-step quadratic convergence rate for a non-quadratic function under certain conditions.

其次，对于n个变量的非二次目标函数也提出了一个步长选取的准则，并在此准则下证明了当目标函数满足一定的条件时，梯度法具有局部n-步二阶收敛速度。

Under mild conditions, we prove that our algorithm has the properties of global convergence and quadratic convergence.

在适当的条件下，证明了算法的全局收敛性和二次收敛性。

For the linear problem, the linearity of the problem is also well preserved in the merit functions. The global convergence, local superlinear or quadratic convergence and finite convergence for linear problems of the proposed algorithms are also obtained under conditions as above or even weaker.

基此构造的互补和混合互补问题的算法，均具备在前述条件或比其更弱条件下的全局收敛性、局部超线性或二次收敛率以及在线性情形下的有限步收敛性。

The algorithm has following properties: Although the merit function has the form of least squares of a system of overdetermined equations, in the Newton equation of our algorithm, only the coefficient matrix of the system of overdetermined equations is used instead of its product as in Guass-Newton method for solving the least squares problems. That is, our Newton method is more like that for the system of nonlinear equations rather than that for LSPs. The global convergence is obtained for VLCP with vertical block P_0 + R_0 matrix; The local quadratic convergence rate is proved under the condition that the solution is BD-regular; Although there is only a Newton equation in our algorithm, the finite convergence property can be shown if matrix is vertical block P— matrix (without the hypotheses of strict complementarity).

该算法具有下列特点：所构造的价值函数虽然具有超定方程组的最小二乘问题的形式，但在基此建立的Newton算法中，其Newton方程的形式更象非线性方程组的Newton法中的Newton方程，仅利用了超定方程组的系数矩阵本身的信息，避免了一般最小二乘问题的Guass-Newton法中必须计算系数矩阵的乘积的工作量；对竖块P_0+R_0矩阵的垂直线性互补问题，算法具有全局收敛性；在解是BD-正则条件下，证明了算法的局部二次收敛性；虽然算法只含一个Newton方程，但对竖块P-矩阵垂直线性互补问题，算法具有有限步收敛性。

And under suitable conditions,we establish the global convergence and locally superlinear/quadratic convergence of the method.

在适当条件下，建立了算法的全局和局部超线性/二阶收敛性

To the tangent distance minimization method,it's quadratic convergence for zero residual problems may not convergence at all.

对于切线距离最小方法，它是接近二次相交零余留的问题，也有可能没有相交。

They didn't possess strong convergence and quadratic convergence rate,more-over,their convergence properties and rate of convergence were only local.

无强收敛性和二次收敛率，甚至收敛性与收敛速度只是局部的。

Under weaker conditions without the strict com-plementarity,the new algorithm still possesses global convergence,strong convergence,superlinearconvergence and quadratic convergence rate.

在无严格互补的条件下，仍获得算法的全局收敛性、强收敛性、超线性收敛性及二次收敛速度。

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算法的收敛速度；并通过一个数值例子的计算结果说明了该算法的优良性，它兼具实现简单及收敛速度快的特点。

During the iterations the trial step is truncated when necessary in order to keep the strict feasibility of the iteration points. It is shown that the LMTI approach and the STI approach have global convergence properties under some reasonable assumptions and will achieve local quadratic convergence rate under some even stronger conditions.

LMTI方法主要利用由有限内存BFGS公式的紧致形式获取的目标函数海色阵的近似矩阵构造信赖域问题模型并对其进行求解；而STI方法在构造的低维子空间上求信赖域子问题的解。

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.

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