The semidefinite programming have the advantage of faster convergence and fewer iteration in solving the combinational optimization problems and NP-completeproblems.
由于半定规划在求解组合优化问题和NP -完全问题时具有收敛速度快，迭代步数少等优点。
2
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Completeproblems (like the Traveling Salesman problem).