Semidefinite Programming 1: If the Primal or the Dual Semidefinite Program Is Strictly Feasible Then p* = d*, and If Both Are, Both Optimal Sets Are NonemptyResearch Paper
A semidefinite program minimizes a linear objective subject to a matrix being positive semidefinite. It includes linear programs and many matrix optimization problems, while allowing constraints on eigenvalues that ordinary coordinate inequalities cannot express. Vandenberghe and Boyd’s 1996 survey helped establish this form as a common language for…