Semidefinite programming relaxation

• 半定规划松弛

Semidefinite programming relaxation的用法和样例：

例句

1. Based on the semidefinite programming relaxation of the max-cut problem, a feasible direction algorithm is proposed, and its convergence is proved.
   摘要本文对最大割问题的半定规划松弛提出一个可行方向法，并给出算法的收敛性证明。