一类新的寻求全局最优解的填充函数 关键词：全局最优解；填充函数法；极小点 [gap=898]Key words：global optimal solution；fiJled function method；minimizer
基于32个网页-相关网页
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质心组合聚类算法·2,447,543篇论文数据，部分数据来源于NoteExpress
Solving the global optimal solution for nonlinear constrained programming is difficult.
求解非线性约束规划的全局最优解是一个难点。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
The computing results show that it not only can find rapidly the approximate global optimal solution, but also has high computing accuracy.
计算结果表明，该算法能快速地求出问题的全局最优解，且具有较好的计算精度。
应用推荐