Every convex free basic semi-algebraic set has an LMI representation (Q456669): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Scott A. McCullough / rank | |||
Property / author | |||
Property / author: Scott A. McCullough / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14C21 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14K05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6093945 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convex set of matrices | |||
Property / zbMATH Keywords: convex set of matrices / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semi-algebraic set | |||
Property / zbMATH Keywords: semi-algebraic set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pencil | |||
Property / zbMATH Keywords: pencil / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linear matrix inequality | |||
Property / zbMATH Keywords: linear matrix inequality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
matrix convex set | |||
Property / zbMATH Keywords: matrix convex set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
semi-definite programming | |||
Property / zbMATH Keywords: semi-definite programming / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Andreas Arvanitoyeorgos / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Benchmarks for Optimization Software / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: On subalgebras of $C^*$-algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subalgebras of C\(^*\)-algebras. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The noncommutative Choquet boundary / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4210476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828515 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Irreducible noncommutative defining polynomials for convex sets have degree 4 or less / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix convexity: Operator analogues of the bipolar and Hahn-Banach theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear matrix inequality representation of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421709 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4787522 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4431278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5693309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Free probability and the von Neumann algebras of free groups / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:13, 5 July 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