👉 In mathematics and mathematical analysis, a semidefinite programming (SDP) or semidefinite relaxation is an optimization problem that can be solved using semidefinite programming (SDP). It is a form of linear programming where the objective function is non-negative. The term "semidefinite" refers to the fact that the objective function and constraints are both semidefinite, meaning they have no negative eigenvalues or eigenvectors. This optimization problem has applications in many fields including machine learning,
