Convex Noncommutative Polynomials Have Degree Two or Less
From MaRDI portal
(Redirected from Publication:4650976)
convexitylinear matrix inequalitymatrix convex polynomialnoncommutative polynomialsymmetric matrices
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
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
- Title not available (Why is no real title available?)
- 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)