bn:03281057n
Noun Concept
Categories: P-complete problems, Linear programming, Convex optimization, Real algebraic geometry
EN
semidefinite programming  Algorithms for semidefinite programming  SDP  Semi-definite programming  semidefinite program
EN
Semidefinite programming is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. Wikipedia
Definitions
Relations
Sources
EN
Semidefinite programming is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space, i.e., a spectrahedron. Wikipedia
An optimization procedure Wikipedia Disambiguation