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.
实验实例表明：该算法收敛速度快，有极强的避免过早收敛及避免局部极值的全局优化的能力。
Using the linear matrix inequality (LMI) technique, the problem is converted into a linear convex optimization algorithm so that a global optimization solution is obtained. Finally.
采用线性矩阵不等式技术，将问题转化为一线性凸优化算法，可得问题的全局最优解。
The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
The application shows that this method is capable of searching the entire solution space in order to find the global optimum, and it is effective and feasible to highway plane optimization design.
实践表明：该方法具有全局解空间搜索能力，从而实现了全局寻优的目的，对公路平面优化设计是有效、可行的。
A stochastic global optimization method based on direct search is introduced to solve the global optimal solution of the problem, and the process is also discussed in detail.
将基于直接搜索法的随机全局优化方法用于求解该问题的全局最优解，给出了具体的算法步骤。
When transferring a geometric constraint equation group into an optimization model, we need a method to jump out of the local beat solution so that we can find a best global solution.
在将几何约束问题的约束方程组转化为优化模型的时候，需要找到一种方法来跳出局部最优解，进而找到全局最优解。
Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.
通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。
The algorithm USES a population of points at a time in contrast to the single point approach by traditional optimization methods. The convergence is monotonic and a global solution is obtained.
与单点最优算法相比，该方法为多点寻优，单调收敛，可获得全局最优解和用于长、短期或实时优化调度。
This algorithm can adjust parameters automatically in the optimization process to find the global optimal solution.
该算法能在优化过程中自动调整各参数，从而取得问题的全局优化解。
The global optimal solution is obtained based on chaotic particle swarm optimization algorithm.
基于混沌粒子群优化算法对优化数学模型进行了求解。
The numerical simulations show that each design solution satisfies all the compulsory criterions and the new method has a better ability for global optimization.
数值仿真结果表明，所有优化结果的性能指标均满足必备指标要求，且新方法具有很强的全局搜索能力。
The simulation results of optimization configuration by utilizing 16 nodes demonstrate that the algorithm can converge the global optimal solution quickly, shows its correctness and validity.
该算法可以获得全局最优解，避免早熟，表明了算法的正确性和有效性。
The simulation results of optimization configuration by utilizing 16 nodes demonstrate that the algorithm can converge the global optimal solution quickly, shows its correctness and validity.
该算法可以获得全局最优解，避免早熟，表明了算法的正确性和有效性。
应用推荐