Jump to content

Spectrahedron

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 00:18, 27 April 2016 (Alan J. Goldman). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A spectrahedron

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 Rn × n, 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.[1]

References

  1. ^ Ramana, Motakuri; Goldman, A. J. (1995), "Some geometric results in semidefinite programming", Journal of Global Optimization, 7 (1): 33–50, doi:10.1007/BF01100204.
Stub icon

This geometry-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Spectrahedron&oldid=717316735"