Interior Point Methods for Semidefinite Programming
摘要
The problem of optimizing a linear function of finitely many matrix variables, subject to finitely many linear equations and inequalities on these variables and the constraints that some of these matrix variables are required to be symmetric positive semidefinite matrices, is called the semidefinite programming (SDP) problem.