Semidefinite Programming

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
A class of convex optimization problems where a linear objective is minimized or maximized subject to affine (linear) constraints and a symmetric matrix variable constrained to be positive semidefinite.