| Revision as of 14:27, 25 February 2013 editماني (talk | contribs)Extended confirmed users, Rollbackers7,041 edits interwiki PersianTag: Addition of interwiki link← Previous edit | Revision as of 23:48, 24 April 2013 edit undoKLBot2 (talk | contribs)96,688 editsm Bot: Migrating 1 interwiki links, now provided by Wikidata on d:Q6400937Next edit → | ||
| Line 13: | Line 13: | ||
| {{geometry-stub}} | {{geometry-stub}} | ||
| ] | |||
Revision as of 23:48, 24 April 2013
In convex geometry, a spectrahedron is a shape that can be represented as a linear matrix inequality. Alternatively, the set of n × n positive semidefinite matrices forms a convex cone in R, and a spectrahedron is a shape that can be formed by intersecting this cone with a linear affine subspace.
Spectrahedra are the solution spaces of semidefinite programs.
References
- Ramana, Motakuri; Goldman, A. J. (1995), "Some geometric results in semidefinite programming", Journal of Global Optimization, 7 (1): 33–50, doi:10.1007/BF01100204.
 | This geometry-related article is a stub. You can help Misplaced Pages by expanding it. |