Every convex free basic semi-algebraic set has an LMI representation (Q456669): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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

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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references