Local convergence of inexact Newton method is discussed.
研究了不精确牛顿法的局部收敛性态。
Used as a local convergence agent and hematinic in medicine.
医药上用作局部收敛剂及补血剂；
Local convergence and local superlinear convergence rate are proved.
证明了方法的局部收敛性和局部超线性收敛性。
We lay particular emphasis on analysis of global and local convergence and rate of convergence.
侧重于收敛的速率和整体、局部分析。
There have many papers for its local convergence, This paper probes into the semi-local convergence using a majorant function principle on some weak condition.
在已有的基础上探讨了它的半局部收敛性，利用强函数原理，在一定的条件下给出并证明不精确牛顿法的半局部收敛性。
Based on the detailed analysis of the local convergence of the system's error signals, the sufficient condition of the system error's local convergence is derived.
在详细地分析了系统误差信号的局部收敛性的基础上，推导出了系统误差局部收敛的充分条件。
In this paper, we establish a class of local convergence theorems for partial sums of arbitrary stochastic adapted sequences which extend some new published results.
研究任意随机适应序列部分和的一类局部极限定理，推广了最近发表的几个结果。
By discussing the local convergence and local continuous in locally convex Spaces, some new sufficient and essential conditions are given on C-locally sequential Spaces.
通过对局部凸空间中局部收敛与局部连续的讨论，给出了C -局部序列空间的一些新的充分必要条件。
Traditional optimizations have disadvantages such as local convergence, when they are used to solve function synthesis of planar 4-bar linkage, which is a complex nonlinear constraint problem.
传统优化算法对于解决平面四杆机构函数综合等复杂非线性约束优化问题存在局部收敛等不足。
During the running time, the particles are updated through the combination form of chaos update and particle swarm update so that the global convergence could balance against local convergence.
在算法运行过程中，对粒子的位置进行混沌更新和粒子群更新相结合的更新方式，使全局收敛与局部收敛达到一定平衡。
The method of judging the local convergence by the variance of the population's fitness and reducing the searching space of variable optimized is proposed, which enhances the searching efficiency.
采用了基于群体适应值方差的早熟判断机制，同时提出了一种缩小混沌搜索的变量空间范围的新方法，提高了搜索效率。
Then some defects such as slow convergence rate and getting into local minimum in BP algorithm are pointed out, and the root of the defects is presented.
分析了BP算法的基本原理，指出了BP算法具有收敛速度慢、易陷入局部极小点等缺陷以及这些缺陷产生的根源。
Traditional neural network algorithms are easy to fall into the local minimum, slow convergence when in fault diagnosis.
传统的神经网络算法应用于故障诊断时，具有易陷入局部极小值，收敛速度较慢等缺点。
Such an algorithm is verified to accelerate convergence process, enhance searching efficiency and solving precision as well as avoid low efficiency and local optimum.
实例证明该算法求解加速了收敛过程，提高了搜索效率，在避免陷入局部最优的同时提高了求解精度。
For complex functions with high dimensions, canonical optimization methods are easy to be trapped in local minima and simple random search methods are slow on convergence.
对于高维复杂函数，传统的确定性算法易陷入局部最小，而单一的全局随机搜索算法收敛速度慢。
The simulation results showed that the new algorithm could control the local minimum, avoid the oscillation, and quicken the convergence speed of blind equalization procession.
仿真结果表明，该算法可有效抑制网络陷入局部极小，防止振荡，加快盲均衡器的收敛速度。
Traditional optimization methods use much more information of the target problem, so their convergence speed is much better, and the ability of finding local optimal is better.
传统的优化方法充分利用了目标问题的信息，局部寻优能力较强，收敛速度较快，但又会陷入局部最优的陷阱。
For accelerating the algorithm convergence and avoiding the local optimization, an individual learning mechanism is often applied to generic algorithm to improve algorithm performance.
在遗传算法中引入个体学习机制能够提高算法的性能，避免算法收敛过慢或陷入局部最优。
The algorithm can get global minimum easily with a wide variety of functions of hidden neurons, and no problems such as local minima and slow rate of convergence are suffered like BP algorithm.
新算法选择很广一类的隐层神经元函数，可以直接求得全局最小点，不存在BP算法的局部极小、收敛速度慢等问题。
The global convergence and local superlinear convergence of the method are established by introducing new approximation techniques.
由于引进了新的逼近技术，该方法具有全局收敛性和局部超线性收敛性。
Compared with the past schemes, the proposed one can escape from local minimum points and guarantee the convergence of joint angles to desired configuration.
与以往的算法相比，所提出的算法可以跳出局部最小点，并使关节收敛到期望构形。
The Elitist model is utilized to ensure the stable convergence, and the Gaussian mutation operator is used to enhance the local search ability around every peak value.
采用最优保存策略和高斯变异算子，保证算法的稳定收敛和提高算法在每个峰值附近的局部搜索能力。
The local superlinear and quadratic convergence of this two models under some mild conditions without the strict complementary condition are analysed and proved.
详细分析和论证两个模型的局部超线性收敛性及二次收敛性条件，其中并不需要严格互补条件。
In the process of codebook design, traditional LBG algorithm owns the advantage of fast convergence, but it is easy to get the local optimal result and be influenced by initial codebook.
在矢量量化的码本设计过程中，经典的LBG算法收敛速度快，但极易陷入局部最优，且初始码本的生成对最佳码本的设计影响很大。
Simulated annealing mechanism is introduced to do local-search for the best chromosome in every generation of the evolution process. This improves the convergence of the algorithm.
算法引入模拟退火机制，在遗传进化过程中的每一代，对最优个体进行邻域局部寻优，利用模拟退火进一步改善算法的收敛性能。
BP algorithm is the most popular training algorithm for feed forward neural network learning. But falling into local minimum and slow convergence are its drawbacks.
BP算法是前馈神经网络训练中应用最多的算法，但其具有收敛慢和陷入局部极值的严重缺点。
BP algorithm is the most popular training algorithm for feed forward neural network learning. But falling into local minimum and slow convergence are its drawbacks.
BP算法是前馈神经网络训练中应用最多的算法，但其具有收敛慢和陷入局部极值的严重缺点。
应用推荐