Semidefinite programming is a nonlinear programming with linear objective function and semidefinite constraints, which has a lot of properties similar to linear programming. It is an important tool to design polynomial-time approximation for NP-hard problems.
KeywordsFeasible Solution Positive Semidefinite Semidefinite Program Convexification Relaxation Vertex Subset
Unable to display preview. Download preview PDF.