算法实例表明，改进后的拉格朗日松弛算法迭代步数显著减少，证明算法是有效的。
Computational examples show that the modified subgradient optimization algorithm for Lagrangean relaxation can reduce the iterative steps obviously, and is proved to be efficient.
由于半定规划在求解组合优化问题和NP -完全问题时具有收敛速度快，迭代步数少等优点。
The semidefinite programming have the advantage of faster convergence and fewer iteration in solving the combinational optimization problems and NP-complete problems.
还证明了紫外信道是最小相位系统，可以进行盲均衡，结果指出，只要迭代次数足够，CMA盲均衡器输出误码率与滤波器阶数、迭代步长关系不是很明显。
It is proved that UV channel is a minimum phase system and can use blind equalizer. Ber is not sensitive to the step size and tap number for CMA blind equalizer.
还证明了紫外信道是最小相位系统，可以进行盲均衡，结果指出，只要迭代次数足够，CMA盲均衡器输出误码率与滤波器阶数、迭代步长关系不是很明显。
It is proved that UV channel is a minimum phase system and can use blind equalizer. Ber is not sensitive to the step size and tap number for CMA blind equalizer.
应用推荐