The simulation results indicate that this algorithm not only guarantees global convergence, but also improves the converging rate and the stability effectively.
仿真结果表明，该算法不仅保证了全局收敛性，而且大大提高了算法的收敛速度和稳定性。
A continuous simulated annealing algorithm with global convergence ability is applied to solve this controller parameters optimization design problem.
采用一类全局收敛的连续模拟退火算法完成了控制器参数的优化设计。
The simulation test was completed through two mechanical design cases. The result shows that the algorithm has high efficiency, rapid speed of convergence and strong capability of global search.
最后通过对两个机械优化设计实例进行仿真试验，结果表明本算法求解效率高、收敛速度快、全局搜索能力强。
Design of experiment and global optimization algorithm are integrated in the system to enhance optimization robustness and accelerate convergence.
优化设计采用试验设计与全局优化算法相结合以提高设计的稳健性，加速收敛。
The superiority of the algorithm is tested through cases and the simulated result shows high efficiency, rapid speed of convergence and strong capability of global search in looking for answers.
最后通过数例检验算法的优越性，仿真结果表明该算法求解效率高、收敛速度快、全局搜索能力强。
Also the proof of global convergence of the algorithm is presented, which is of value for discussions of convergence of more general algorithms.
还证明了该算法的总体收敛性，其证明方法对一般迭代算法的收敛性讨论具有参考价值。
With the improved algorithm, the multiple hump function can be dealt with efficiently and the goal of global convergence achieved.
改进后的算法在提高精度的同时能够达到全局收敛，并能有效地处理多极值问题。
It is shown that this algorithm ensures convergence to a global minimum with probability 1in a compact region of a weight vector space.
关于算法分析的定理证明了这种混合算法对于紧致集内的权向量构成的任意连续函数能依概率1收敛于全局极小值。
In this paper we describe an interior algorithm with global convergence of the general optimization problem.
该篇论文针对约束最优化的一般性问题，提出一种具有全局收敛性的内点算法。
By using gradient algorithm, the global convergence of the cost-function can be guaranteed.
本文证明了使用梯度算法，新价值函数的全局收敛性能得到保证。
We prove that the algorithm is well defined and the global convergence of method is obtained without regular conditions.
第四章我们首先证明了算法是有定义的，其次在没有正则性条件的假设下证明了算法的全局收敛性。
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算法的局部极小、收敛速度慢等问题。
For very general single location on a closed convex domain, propose a combining algorithm which has global convergence.
针对一般具闭凸集约束的单址选址模型，提出具全局收敛性的组合算法。
A recursive algorithm with randomly varying truncation for adaptive Bram-Formers is proposed. Simple conditions are obtained to guarantee for this algorithm the global convergence almost everywhere.
本文对适应性波束形成器给出一种递推随机变界截尾算法，并在较简单的条件下，证明了算法几乎处处具有大范围收敛性。
Based on the model, the convergence of the algorithm is analyzed and the global convergence of the algorithm is proved when leaving the divert probability out of account.
在不考虑状态转移概率的情况下证明了思维进化算法能够收敛到全局最优解。
This paper presents a new descend algorithm for nonlinear complementarity problems. The global convergence of the algorithm is proved under milder conditions.
针对非线性互补问题，提出了与其等价的非光滑方程的一个下降算法，并在一定条件下证明了该算法的全局收敛性。
This paper discusses a model algorithm for composite nonsmooth optimization problems and proves that the algorithm holds global convergence and in the meantime the convergent rate is superlinear.
提出复合非光滑优化问题的一类算法，并证明这种算法保持全局收敛性且敛速达到超线性。
The algorithm has not only the implicit parallelism, global convergence of POA and the intelligence of tabu search, but also the fast convergence of MSCOA.
该方法具有逐次优化算法的隐性并行性和收敛性，禁忌搜索的智能性和变尺度混沌优化方法的快速性。
Both line search and trust region algorithm are well-accepted methods in the optimization to assure global convergence.
线性搜索方法和信赖域方法是保证最优化问题的整体收敛性的两种基本策略。
Under the general assumption, the algorithm of global convergence and superlinear convergence are proved.
在一般假设条件下，证明了算法的全局收敛性和超线性收敛性。
Under the general assumption, the algorithm of global convergence and superlinear convergence are proved.
在一般假设条件下，证明了算法的全局收敛性和超线性收敛性。
应用推荐