Improving BP neural network with simulated annealing algorithm can overcome the defect of falling into local optimal point easily, and further improve the network performance.
用模拟退火算法改进BP神经网络，克服了BP神经网络极易陷入局部最优点的缺点，进一步提高了网络的性能。
We prove that when the homotopy map is a regular map, the K-K-T point obtained from this homotopy method must be a local optimal solution by choosing proper homotopy equation.
证明了同伦映射为正则映射的条件下，选取合适的同伦方程，用此同伦方法得到的K-K-T点一定是问题局部最优解。
In the process of optimization, the method has the ability of escaping from the local minimized point and arriving at the global optimal point by setting an escaping coefficient.
通过设定逃逸系数，算法在寻优过程中具有了能够跳出局部极小点到达全局最优点的能力。
Iterative TFIDF algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
The BFGS algorithm applied in GCS is analyzed and pointed out two shortcomings: (1) always trapped in local optimal solution; (2) can not pass through the critical point.
分析了BFGS算法在约束求解中的应用，指出了在约束求解这一特定的领域利用BFGS算法进行约束求解的两大缺陷：（1）容易陷入局部最优解：（2）无法穿越临界点。
The BFGS algorithm applied in GCS is analyzed and pointed out two shortcomings: (1) always trapped in local optimal solution; (2) can not pass through the critical point.
分析了BFGS算法在约束求解中的应用，指出了在约束求解这一特定的领域利用BFGS算法进行约束求解的两大缺陷：（1）容易陷入局部最优解：（2）无法穿越临界点。
应用推荐