一类新的寻求全局最优解的填充函数 关键词：全局最优解；填充函数法；极小点 [gap=898]Key words：global optimal solution；fiJled function method；minimizer
基于32个网页-相关网页
最终收敛到全局最优解 global minimal
For the choice of initial cluster K-Means clustering algorithm is very sensitive, its results are frequently a local optimal solution rather than a global optimal solution.
K-Means算法的聚类结果对初始簇的选择非常敏感，通常获得的是局部最优解而非全局最优解。
参考来源 - 基于竞争学习的K质心组合聚类算法The simulation results show that the suggested methods give better global convergent characteristics and faster convergence.
模拟结果表明所提出的非线性系统控制方法给出了更精确的全局最优解和更快速的收敛速率。
参考来源 - 基于神经网络的倒立摆控制系统数值模拟Mutation in small scope can find the better solution based on the optimal solution and has more chance to get the global best solution.
小范围变异能在较优解的基础上找到更优的解,增加找到全局最优解的机会。
参考来源 - 抗体克隆算法在配电网络重构中的应用The results of case studies show that the ASA/GA has good capability in convergence speed and finding the global optimum with a high probability and can successfully solve the NLP model established from synthesis of multi-contaminant MEN.
对各实例的求解表明该算法在收敛速度及以更大概率获得全局最优解方面具有良好的性能,可以有效地求解由多组分MEN综合所形成的NLP问题。
参考来源 - 基于传质浓度差同步优化多组分质量交换网络·2,447,543篇论文数据，部分数据来源于NoteExpress
进化规划(EP)是一种随机优化技术，它可以发现全局最优解。
Evolutionary Programming (EP), a multi agent stochastic optimization technique, can lead to global optimal solutions for complex problems.
实验结果表明，该算法能够保证求得全局最优解，并且寻优速度有很大提高。
The experiment shows the algorithm can surely and rapidly get global optimum solution and greatly improve con vergence rate.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
应用推荐