Every convex free basic semi-algebraic set has an LMI representation (Q456669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every convex free basic semi-algebraic set has an LMI representation |
scientific article; zbMATH DE number 6093945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every convex free basic semi-algebraic set has an LMI representation |
scientific article; zbMATH DE number 6093945 |
Statements
Every convex free basic semi-algebraic set has an LMI representation (English)
0 references
16 October 2012
0 references
It is known that the matricial solution set of a linear matrix inequality (LMI) is a convex free basic open semi-algebraic set. The main theorem of this paper is a converse, namely that each such set arises from some LMI. The result has implications for semi-definite programming and systems engineering as well as for free semi-algebraic geometry.
0 references
convex set of matrices
0 references
semi-algebraic set
0 references
pencil
0 references
linear matrix inequality
0 references
matrix convex set
0 references
semi-definite programming
0 references
0.8499758839607239
0 references
0.8463666439056396
0 references
0.8120846152305603
0 references
0.8109068274497986
0 references
0.8079763054847717
0 references
