Hermitian linear matrix pencils are ubiquitous in control theory, operator
systems, semidefinite optimization, and real algebraic geometry. This survey
reviews the fundamental features of the matricial solution set of a linear
matrix inequality, the free spectrahedron, from the perspective of free real
algebraic geometry. Namely, among matricial solution sets of noncommutative
polynomial inequalities, free spectrahedra are precisely the convex ones.
Furthermore, a procedure for detecting free spectrahedra and producing their
representing linear matrix pencils is discussed. Finally, free spectrahedra
admit a perfect Positivstellensatz, leading to a semidefinite programming
formulation of eigenvalue optimization over convex matricial sets constrained
by noncommutative polynomial inequalities.
Metrics
33 Record Views
Details
Title
Linear matrix pencils and noncommutative convexity
Creators
Jurij Volčič
Publication Details
arXiv.org
Resource Type
Preprint
Language
English
Academic Unit
Mathematics
Other Identifier
991021893569004721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services