Non-commutative partial matrix convexity
From MaRDI portal
Abstract: Let be a polynomial in the non-commuting variables . If is convex in the variables , then has degree two in and moreover, has the form where has degree at most one in and is a (column) vector which is linear in so that is a both sum of squares and homogeneous of degree two. Of course the converse is true also. Further results involving various convexity hypotheses on the and variables separately are presented.
Recommendations
Cited in
(17)- A local-global principle for linear dependence of noncommutative polynomials.
- An introduction to matrix convex sets and free spectrahedra
- Noncommutative partially convex rational functions
- The royal road to automatic noncommutative real analyticity, monotonicity, and convexity
- Noncommutative partial convexity via \(\Gamma\)-convexity
- Convexity and semidefinite programming in dimension-free matrix unknowns
- A complete characterization of the gap between convexity and sos-convexity
- Non-commutative polynomials with convex level slices
- Quasi-convex free polynomials
- Convex entire noncommutative functions are polynomials of degree two or less
- Convex Noncommutative Polynomials Have Degree Two or Less
- Noncommutative convexity in matricial *-rings
- Bilinear matrix inequalities and polynomials in several freely noncommuting variables
- Noncommutative plurisubharmonic polynomials. I: Global assumptions
- xy-convex free polynomials revisited
- Title not available (Why is no real title available?)
- Noncommutative convexity arises from linear matrix inequalities
This page was built for publication: Non-commutative partial matrix convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606164)