This article concerns the question, Which subsets of R m can be represented with linear matrix inequalities (LMIs)? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in control theory. Also, before having much hope of representing engineering problems as LMIs by automatic methods, one needs a good idea of which problems can and cannot be represented by LMIs. Little is currently known about such problems. In this article we give a necessary condition that we call "rigid convexity," which must hold for a set C ⊆ R m in order for C to have an LMI representation. Rigid convexity is proved to be necessary and sufficient when m = 2. This settles a question formally stated by Pablo Parrilo and Berndt Sturmfels in [15]. As shown by Lewis, Parillo, and Ramana [11], our main result also establishes (in the case of three variables) a 1958 conjecture by Peter Lax on hyperbolic polynomials.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.