Convex Noncommutative Polynomials Have Degree Two or Less

DOI10.1137/S0895479803421999MaRDI QIDQ4650976zbMATH OpenFDO

Authors J. William Helton, Scott McCullough

Publication date 21 February 2005

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895479803421999

zbMATH Keywords

convexitylinear matrix inequalitymatrix convex polynomialnoncommutative polynomialsymmetric matrices

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Convexity of real functions of several variables, generalizations (26B25) Functions whose values are linear operators (operator- and matrix-valued functions, etc., including analytic and meromorphic ones) (47A56) Linear operator inequalities (47A63) Operator spaces (= matricially normed spaces) (47L25)

Recommendations

• Non-commutative polynomials with convex level slices
• Quasi-convex free polynomials
• Non-commutative partial matrix convexity
• Noncommutative polynomials describing convex sets
• Convex entire noncommutative functions are polynomials of degree two or less

Cited in

(32)

• 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
• The noncommutative Löwner theorem for matrix monotone functions over operator systems
• Non-commutative polynomial solutions to partial differential equations
• Noncommutative partially convex rational functions
• The royal road to automatic noncommutative real analyticity, monotonicity, and convexity
• The Hessian of a noncommutative polynomial has numerous negative eigenvalues
• A nichtnegativstellensatz for polynomials in noncommuting variables
• Matrix representations for positive noncommutative polynomials
• Plurisubharmonic noncommutative rational functions
• On trace-convex noncommutative polynomials
• Convexity and semidefinite programming in dimension-free matrix unknowns
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• Non-commutative polynomials with convex level slices
• Quasi-convex free polynomials
• Convex entire noncommutative functions are polynomials of degree two or less
• Non-commutative varieties with curvature having bounded signature
• Non-commutative partial matrix convexity
• The convex Positivstellensatz in a free algebra
• Minimizer Extraction in Polynomial Optimization Is Robust
• Free semidefinite representation of matrix power functions
• Free Pick functions: representations, asymptotic behavior and matrix monotonicity in several noncommuting variables
• Irreducible noncommutative defining polynomials for convex sets have degree 4 or less
• Symmetry reduction to optimize a graph-based polynomial from queueing theory
• Bilinear matrix inequalities and polynomials in several freely noncommuting variables
• Noncommutative plurisubharmonic polynomials. I: Global assumptions
• xy-convex free polynomials revisited
• Extensions of \(\mathrm{S}\)-lemma for noncommutative polynomial
• Noncommutative plurisubharmonic polynomials. II: Local assumptions
• Noncommutative plurisubharmonicity, existence of pluriharmonic conjugates, and free universal monodromy
• Noncommutative convexity arises from linear matrix inequalities
• Non-commutative harmonic and subharmonic 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)