Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or maximize) over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. (Wikipedia)
There is no tag wiki for this tag … yet!
Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.
All registered users may propose new tag wikis.
(Note that if you have less than 4000 reputation, your tag wiki will be peer reviewed before it is published.)