Linear matrix inequality representation of sets

From MaRDI portal
Publication:3437010

DOI10.1002/CPA.20155zbMATH Open1116.15016arXivmath/0306180OpenAlexW2025202934MaRDI QIDQ3437010FDOQ3437010


Authors: J. William Helton, Victor Vinnikov Edit this on Wikidata


Publication date: 11 May 2007

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Abstract: This article concerns the question: which subsets of mathbbRm 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, we call "rigid convexity", which must hold for a set cCinmathbbRm in order for cC 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 [PSprep].


Full work available at URL: https://arxiv.org/abs/math/0306180




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Linear matrix inequality representation of sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437010)