Non-commutative partial matrix convexity

DOI10.1512/IUMJ.2008.57.3638MaRDI QIDQ3606164zbMATH OpenOpenAlexFDO

Authors Damon Hay, J. William Helton, Adrian P. C. Lim, Scott McCullough

Publication date 26 February 2009

Published in Indiana University Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.0633

zbMATH Keywords

linear matrix inequalitiesnon-commutative convex polynomials

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Linear operator inequalities (47A63) Semialgebraic sets and related spaces (14P10)

Abstract: Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,\mathrm{...},a_{g_a},x_1,\mathrm{...},x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p=L+Lambd{a}^{T}Lambda,$ where $L$ has degree at most one in $x$ and $Lambda$ is a (column) vector which is linear in $x,$ so that $Lambd{a}^{T}Lambda$ 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 $x$ and $a$ variables separately are presented.

Recommendations

• Convex Noncommutative Polynomials Have Degree Two or Less
• Convex and positive noncommutative polynomials
• Convex entire noncommutative functions are polynomials of degree two or less
• Non-commutative polynomials with convex level slices
• Noncommutative convexity arises from linear matrix inequalities

Cited in

(16)

• A complete characterization of the gap between convexity and sos-convexity
• Noncommutative convexity in matricial *-rings
• Bilinear matrix inequalities and polynomials in several freely noncommuting variables
• An introduction to matrix convex sets and free spectrahedra
• Non-commutative polynomials with convex level slices
• Quasi-convex free polynomials
• Noncommutative partially convex rational functions
• A local-global principle for linear dependence of noncommutative polynomials.
• Convexity and semidefinite programming in dimension-free matrix unknowns
• Convex Noncommutative Polynomials Have Degree Two or Less
• The royal road to automatic noncommutative real analyticity, monotonicity, and convexity
• Convex entire noncommutative functions are polynomials of degree two or less
• Noncommutative plurisubharmonic polynomials. I: Global assumptions
• xy-convex free polynomials revisited
• Noncommutative convexity arises from linear matrix inequalities
• Noncommutative partial convexity via \(\Gamma\)-convexity

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)