查询词典 global convergence

The proposed algorithm has advantages to the global searching ability of genetic algorithm and the stable convergence of dimidiate searching root method.

结合传统遗传算法良好的全局搜索能力和二分法可靠的收敛性，本文提出了一种改进的遗传算法－层次压缩遗传算法。

The superiority of the algorithm is tested through cases and the simulated result shows that it has high efficiency,rapid speed of convergence and strong capability of global search.

通过实例检验算法的优越性，仿真结果表明该算法求解效率高，收敛速度快，全局搜索能力强。

In analysis, the global cursory model,the submodel cursory/fine analytic method are adopted to achieve certain accuracy and the convergence.

在分析时采用全域粗糙模型、局部粗糙/精细模型有限元素分析法，使其达到精准性与收敛性。

Under mild conditions, we prove the global and superlinear convergence of the method.

在较弱的条件下，得到了算法的全局收敛性及其超线性收敛性。

The global and superlinear convergence results of the new algorithm are established.

该算法中我们允许使用非精确的方法近似求解信赖域子问题。

Under mild conditions, we establish the global and superlinear convergence results for the method.

在适当的假设条件下，我们证明了算法具有全局收敛性和超线性收敛性。

By choosing the proper parameters, we can prove that the new method has global and superlinear convergence properties under suitable conditions.

通过选择适当的参数，证明了改进的BFGS方法对于一类更广的搜索准则保持局部收敛性，在Wolfe搜索准则下方法还具有超线性收敛性。

Under mild conditions,a new feasible descent algorithm is presented and its global and superlinear convergence are proved by using the technique of combining generalized projection method with sequential systems of linear equations.

在较温和的条件下，采用广义投影和序列线性方程组相结合的技术，建立一个新的可行下降算法，证明了算法的全局收敛性和超线性收敛性。

In the first chapter, the application background and the main algorithms of the complementarity problems is introduced. In Chapter 2, some basic definitions and theories of complementarity problems are introduced. The 3rd chapter is the most important part of this paper, in which a new class of smoothing Newton method is detailed, also the global and local superlinear convergence is established for the method. In the 4th chapter, we propose some numerical experiment, and the results show the effectiveness of the proposed algorithms.

全文共分为四章，各部分内容安排如下：第一章是绪论部分，介绍了互补问题的应用背景和近年来有关互补问题求解方法的研究成果；第二章介绍了与互补问题相关的一些定义以及相关的定理和推论；第三章是本文的重点，构造了求解互补问题的一类光滑牛顿法，从理论上证明了算法的全局收敛性和局部超线性收敛性；第四章是数值实验，通过数值试验的结果进一步证明了算法的可行性和有效性。

In Chapter 2, combining two types of the preconvex part of modified Broydens family with Armijo line search, we get two algorithms for solving unconstrained optimization problems, and prove these algorithms are global and superlinear convergence under some suitable conditions.

第二章，将两种修改Broyden非凸族与Armijo线搜索相结合，得到了求解无约束最优化问题两种算法，在适当的条件下，证明了这些算法具有全局收敛性和超线性收敛性。

The big eared hedgehog, the little owl, the sand gecko, the three-toed jerboa, and every show needs a villain - saw-scale - the viper!

大耳刺猬，小猫头鹰，沙壁虎，三趾跳鼠，每场戏都需要反派角色：蝰蛇。

Plasmodiophora brassicae ; resting spores ; density gradient centrifugation of sucrose ; ultrasonic disruption

根肿；休眠孢子；蔗糖密度梯度离心；超声波破碎