Every convex free basic semi-algebraic set has an LMI representation (Q456669): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4007/annals.2012.176.2.6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127765692 / rank | |||
Normal rank | |||
Revision as of 20:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every convex free basic semi-algebraic set has an LMI representation |
scientific article |
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
