Some geometric results in semidefinite programming
- Cite this article as:
- Ramana, M. & Goldman, A.J. J Glob Optim (1995) 7: 33. doi:10.1007/BF01100204
- 414 Downloads
The purpose of this paper is to develop certain geometric results concerning the feasible regions of Semidefinite Programs, called hereSpectrahedra.
We first develop a characterization for the faces of spectrahedra. More specifically, given a pointx in a spectrahedron, we derive an expression for the minimal face containingx. Among other things, this is shown to yield characterizations for extreme points and extreme rays of spectrahedra. We then introduce the notion of an algebraic polar of a spectrahedron, and present its relation to the usual geometric polar.