Semidefinite programming: Difference between revisions

Content deleted Content added
m +{{Authority control}} (1 ID from Wikidata); WP:GenFixes & cleanup on
Importing Wikidata short description: "Subfield of convex optimization"
Line 1:
{{Short description|Subfield of convex optimization}}
'''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 (linear algebra)|cone]] of [[Positive-definite matrix#Negative-definite, semidefinite and indefinite matrices|positive semidefinite]] [[Matrix (mathematics)|matrices]] with an [[affine space]], i.e., a [[spectrahedron]].