The CSPSO is guaranteed to converge to the global optimization solution with probability one.
并证明了它依概率收敛于全局最优解。
The sequential outer approximation approach can give a global optimization solution to the original problem.
该非线性优化问题用渐进外逼近算法可求出其全局最优解。
The position and the weighted coefficients can be optimized at the same time. The cases showed that this method had a strong ability to find to global optimization solution.
实验实例表明：该算法收敛速度快，有极强的避免过早收敛及避免局部极值的全局优化的能力。
应用推荐