The matricial relaxation of a linear matrix inequality
Given linear matrix inequalities (LMIs) L-1 and L-2 it is natural to ask: (Q(1)) when does one dominate the other, that is, does L-1(X) >= 0 imply L-2(X) >= 0? (Q(2)) when are they mutually dominant, that is, when do they have the same solution set? The matrix cube problem of Ben-Tal and Nemirovski (SIAM J Optim 12:811-833, 2002) is an example of LMI domination. Hence such problems can be NP-hard. This paper describes a natural relaxation of an LMI, based on substituting matrices for the variables x(j). With this relaxation, the domination questions (Q(1)) and (Q(2)) have elegant answers, indeed reduce to constructible semidefinite programs. As an example, to test the strength of this relaxation we specialize it to the matrix cube problem and obtain essentially the relaxation given in Ben-Tal and Nemirovski (SIAM J Optim 12: 811-833, 2002). Thus our relaxation could be viewed as generalizing it. Assume there is an X such that L-1(X) and L-2(X) are both positive definite, and suppose the positivity domain of L-1 is bounded. For our "matrix variable" relaxation a positive answer to (Q(1)) is equivalent to the existence of matrices V-j such that L-2(x) = V-1* L-1 (x) V-1 + . . . + V-mu* L-1 (x) V mu. (A(1)) As for (Q(2)) we show that L-1 and L-2 are mutually dominant if and only if, up to certain redundancies described in the paper, L-1 and L-2 are unitarily equivalent. Algebraic certificates for positivity, such as (A(1)) for linear polynomials, are typically called Positivstellensatze. The paper goes on to derive a Putinar-type Positivstellensatz for polynomials with a cleaner and more powerful conclusion under the stronger hypothesis of positivity on an underlying bounded domain of the form {X vertical bar L(X) >= 0}. An observation at the core of the paper is that the relaxed LMI domination problem is equivalent to a classical problem. Namely, the problem of determining if a linear map tau from a subspace of matrices to a matrix algebra is "completely positive". Complete positivity is one of the main techniques of modern operator theory and the theory of operator algebras. On one hand it provides tools for studying LMIs and on the other hand, since completely positive maps are not so far from representations and generally are more tractable than their merely positive counterparts, the theory of completely positive maps provides perspective on the difficulties in solving LMI domination problems.
linear matrix inequality (lmi) semidefinite programming positivstellensatz completely positive gleichstellensatz archimedean quadratic module real algebraic geometry free positivity