It is well known that the constraint of semidefinite is nonlinear and nonsmooth, but convex, So semidefinite programming is convex optimization problems.

• 半定规划的约束是非线性的，非光滑的，但却是凸的，因此是凸规划。