2011/02/21 by Avinash Bhardwaj, Bhardwaj, Avinash, Philipp Rostalski +3
Computer Science · #52A27 (Secondary) #90C22 (Primary) #Advanced Graph Theory Research #Digital Image Processing Techniques #FOS: Mathematics #Interconnection Networks and Systems #Metric Geometry (math.MG) #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.1102.4367
openalex publication_date 2011/02/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove a result of Ramana (1998) regarding the structure of spectrahedra and we devise a normal form of representations of spectrahedra. This normal form is effectively computable and leads to an algorithm for deciding polyhedrality.