| 1. | The algorithm give over vice of the simple back propagation algorithm ( sbp ) that plunge the part extremes in some intricate nonlinear problems
同时，针对sbp神经网络对于复杂的非线性问题容易陷入局部极值，提出了改进的bp算法( nfcs - caf ) 。 |
| 2. | Abstract new methods were joined into the quantum genetic algorithm to solve the defects of poor local search ability and more iterative times
摘要针对量子遗传算法在多维复杂函数优化中迭代次数多、易陷入局部极值等缺点，提出新的量子遗传算法。 |
| 3. | The proposed approach is robust to local minima of the energy functional because it is minimized by dynamic programming method in the whole energy space
由于采用了动态规划法并在整个能量空间中搜索能量泛函的极值，算法对能量泛函的局部极值有较强的鲁棒性。 |
| 4. | And the repeated optimization method is a kind of climbing , so it ' s easy to convergent to local extermum . how to solve it is the problem that the paper will discuss
另外，由于迭代最优化方法是一种爬山法，所以难免会收敛到局部极值，因此如何解决该问题也是本文将讨论。 |
| 5. | The basic principle of cpso algorithm is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum
该算法的思想是采用混沌初始化进行改善个体质量和利用混沌扰动避免搜索过程陷入局部极值。 |
| 6. | A migration velocity analysis method is proposed , in which the problem of velocity analysis is converted to the problem of determining the local maximums of the defined criterion function
利用等时原理，把建立速度场问题转化为求取判别函数的局部极值问题，可以利用优化方法求解此问题。 |
| 7. | Gradient methods of them are efficient , but have disadvantages of getting stuck in local minima , requiring gradients calculations , working only on continuous and differentiable parameters
其中,共轭梯度法收敛速度较快,但要求目标函数可微、连续,而且优化参数数目有限;随机搜索无需计算梯度,但是效率太低,而且容易陷入局部极值。 |
| 8. | In the course of searching the optimum solution , it can accept a value make objective function good , but also a bad one . in this way it will avoid falling into a local extremum and get a global optimum value
而且在搜索的过程中，不仅接受使目标函数变好的解，而且还能以一定的概率接受坏解，这样将尽量避免陷入局部极值解而达到全局最优解。 |
| 9. | And comparing with the standard simulated annealing algorithm and genetic algorithm , this algorithm has rapider converge speed and the strong global optimize performance of divorcing from local extreme point and avoiding converging too early
且理论上可以证明其相对于标准模拟退火算法、遗传算法有更快的收敛速度及很强的脱离局部极值点和避免过早收敛的全局优化能力。 |
| 10. | Aimed at the ga ' s disadvantages : weak local optimization , easiness of falling into local extremum , this thesis presents an improved ga which introduces two operators " local search " and " adaptively avoid entropy decreasing "
针对遗传算法局部搜索能力差及容易陷入局部极值点的缺陷，提出一种改进的遗传算法，引入了“局部搜索?均值方差阀值”和“自适应防止熵减”两个算子。 |
