<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>Non-commutative partial matrix convexity</dc:title>
<dc:creator>Damon Hay</dc:creator><dc:creator>J. William Helton</dc:creator><dc:creator>Adrian Lim</dc:creator><dc:creator>Scott McCullough</dc:creator>
<dc:subject>47Axx</dc:subject><dc:subject>47A63</dc:subject><dc:subject>14P10</dc:subject><dc:subject>non-commutative convex polynomials</dc:subject><dc:subject>linear matrix inequalities</dc:subject>
<dc:description>Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,\dots,a_{g},x_1,\dots,x_{g})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and  moreover, $p$ has the form $$p = L + \Lambda ^T \Lambda,$$ where $L$ has degree at most one in $x$ and $\Lambda$ is a (column) vector which is linear in $x$, so that $\Lambda^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.</dc:description>
<dc:publisher>Indiana University Mathematics Journal</dc:publisher>
<dc:date>2008</dc:date>
<dc:type>text</dc:type>
<dc:format>pdf</dc:format>
<dc:identifier>10.1512/iumj.2008.57.3638</dc:identifier>
<dc:source>10.1512/iumj.2008.57.3638</dc:source>
<dc:language>en</dc:language>
<dc:relation>Indiana Univ. Math. J. 57 (2008) 2815 - 2842</dc:relation>
<dc:coverage>state-of-the-art mathematics</dc:coverage>
<dc:rights>http://iumj.org/access/</dc:rights>
</oai_dc:dc>