Mathematics – Operator Algebras
Scientific paper
2011-12-29
Pages 377-405 in the Handbook of Semidefinite, Conic and Polynomial Optimization edited by M. Anjos and J. B. Lasserre, Spring
Mathematics
Operator Algebras
25 pages; survey
Scientific paper
10.1007/978-1-4614-0769-0_13
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.
Helton John William
Klep Igor
McCullough Scott
No associations
LandOfFree
Semidefinite programming in matrix unknowns which are dimension free does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Semidefinite programming in matrix unknowns which are dimension free, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semidefinite programming in matrix unknowns which are dimension free will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-728390