Semidefinite programming in matrix unknowns which are dimension free
arXiv:1112.6251 · doi:10.1007/978-1-4614-0769-0_13
Abstract
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain non-commutative polynomials in matrices. These polynomials depend only on the system layout and do not change with the size of the matrices involved, hence such problems are called "dimension-free". Analyzing dimension-free problems has led to the development recently of a non-commutative (nc) real algebraic geometry (RAG) which, when combined with convexity, produces dimension-free Semidefinite Programming. This article surveys what is known about convexity in the non-commutative setting and nc SDP and includes a brief survey of nc RAG. Typically, the qualitative properties of the non-commutative case are much cleaner than those of their scalar counterparts - variables in R^g. Indeed we describe how relaxation of scalar variables by matrix variables in several natural situations results in a beautiful structure.
25 pages; survey
References in corpus (10)
- Convergent relaxations of polynomial optimization problems with non-commuting variables
- Connes' embedding conjecture and sums of hermitian squares
- The Lax conjecture is true
- The noncommutative Choquet boundary
- Proper Analytic Free Maps
- Analytic mappings between noncommutative pencil balls
- Sums of hermitian squares and the BMV conjecture
- Positive polynomials in scalar and matrix variables, the spectral theorem and optimization
- Noncommutative ball maps
- Every free basic convex semi-algebraic set has an LMI representation