一类新的寻求全局最优解的填充函数 关键词：全局最优解；填充函数法；极小点 [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
This algorithm can adjust parameters automatically in the optimization process to find the global optimal solution.
该算法能在优化过程中自动调整各参数，从而取得问题的全局优化解。
Solving the global optimal solution for nonlinear constrained programming is difficult.
求解非线性约束规划的全局最优解是一个难点。
The global optimal solution is obtained based on chaotic particle swarm optimization algorithm.
基于混沌粒子群优化算法对优化数学模型进行了求解。
应用推荐