Resultant images synthesized by the algorithm is presented here also. 另外，给出算法实际运行得到的具有高度真实感的生成图象。
Based on the semidefinite programming relaxation of the max-cut problem, a feasible direction algorithm is proposed, and its convergence is proved. 摘要本文对最大割问题的半定规划松弛提出一个可行方向法，并给出算法的收敛性证明。
