Convex Noncommutative Polynomials Have Degree Two or Less
DOI10.1137/S0895479803421999zbMATH Open1102.47009MaRDI QIDQ4650976FDOQ4650976
J. William Helton, Scott McCullough
Publication date: 21 February 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Recommendations
convexitylinear matrix inequalitysymmetric matricesnoncommutative polynomialmatrix convex polynomial
Miscellaneous inequalities involving matrices (15A45) Convexity of real functions of several variables, generalizations (26B25) Linear operator inequalities (47A63) Operator spaces (= matricially normed spaces) (47L25) Functions whose values are linear operators (operator- and matrix-valued functions, etc., including analytic and meromorphic ones) (47A56)
Cited In (25)
- The Hessian of a noncommutative polynomial has numerous negative eigenvalues
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Minimizer Extraction in Polynomial Optimization Is Robust
- Free Pick functions: representations, asymptotic behavior and matrix monotonicity in several noncommuting variables
- Quasi-convex free polynomials
- Plurisubharmonic noncommutative rational functions
- Noncommutative partially convex rational functions
- Non-commutative partial matrix convexity
- The convex Positivstellensatz in a free algebra
- The royal road to automatic noncommutative real analyticity, monotonicity, and convexity
- Free semidefinite representation of matrix power functions
- Irreducible noncommutative defining polynomials for convex sets have degree 4 or less
- Convex entire noncommutative functions are polynomials of degree two or less
- Non-commutative varieties with curvature having bounded signature
- The noncommutative Löwner theorem for matrix monotone functions over operator systems
- Noncommutative plurisubharmonic polynomials. I: Global assumptions
- Noncommutative plurisubharmonic polynomials. II: Local assumptions
- A nichtnegativstellensatz for polynomials in noncommuting variables
- Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns
- Non-commutative harmonic and subharmonic polynomials
- Noncommutative convexity arises from linear matrix inequalities
- Non-commutative polynomial solutions to partial differential equations
- Classification of all noncommutative polynomials whose Hessian has negative signature one and a noncommutative second fundamental form
- Matrix inequalities: A symbolic procedure to determine convexity automatically
- Matrix representations for positive noncommutative polynomials
This page was built for publication: Convex Noncommutative Polynomials Have Degree Two or Less
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650976)