Abstract
This article resides in the realm of the noncommutative (free) analog of real algebraic geometry - the study of polynomial inequalities and equations over the real numbers - with a focus on matrix convex sets <!-- MATH $\mathcal {C}$ --> and their projections <!-- MATH $\hat {\mathcal {C}}$ --> . A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which suggests that convex free semialgebraic sets are rare. Further, a cornerstone of real algebraic geometry fails in the free setting: The projection of a free convex semialgebraic set need not be free semialgebraic. Both of these results, and the importance of convex approximations in the optimization community, provide impetus and motivation for the study of the matrix convex hull of free semialgebraic sets.

This publication has 40 references indexed in Scilit: