The matricial relaxation of a linear matrix inequality
DOI10.1007/s10107-012-0525-zzbMath1272.15012arXiv1003.0908OpenAlexW3106417306MaRDI QIDQ1949260
J. William Helton, Igor Klep, Scott A. McCullough
Publication date: 6 May 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0908
semidefinite programminglinear matrix inequalityrelaxation algorithmcompletely positivePositivstellensatzfree positivityreal algebraic geometryGleichstellensatzArchimedean quadratic module
Semidefinite programming (90C22) Noncommutative algebraic geometry (14A22) Sums of squares and representations by other particular quadratic forms (11E25) Linear inequalities of matrices (15A39) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Semidefinite programming relaxations for semialgebraic problems
- A nichtnegativstellensatz for polynomials in noncommuting variables
- Subalgebras of \(C^ *\)-algebras
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- The noncommutative Choquet boundary
- Pure states, positive matrix polynomials and sums of hermitian squares
- The noncommutative Choquet Boundary III
- A positivstellensatz for non-commutative polynomials
- Handbook of semidefinite programming. Theory, algorithms, and applications