Non-commutative polynomials with convex level slices

DOI10.1512/IUMJ.2017.66.6219MaRDI QIDQ3133345zbMATHOpenAlexFDO

Authors Harry Dym, J. William Helton, Scott McCullough

Publication date 14 February 2018

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

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

zbMATH Keywords

quasiconvexitymatrices of noncommutative polynomials

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Semidefinite programming (90C22) Operator spaces and completely bounded maps (46L07) Matrix equations and identities (15A24) Gamma, beta and polygamma functions (33B15) Dilations, extensions, compressions of linear operators (47A20) Real algebra (13J30)

Abstract: Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The polynomial p is symmetric if it takes symmetric values. Under natural irreducibility assumptions and other mild hypothesis, the article gives an algebraic certificate for symmetric polynomials p with the property that for sufficiently many tuples A, the set of those tuples X such that p(A,X) is positive definite is convex. In particular, p has degree at most two in x. The case of noncommutative quasi-convex polynomials is of particular interest. The problem analysed here occurs in linear system engineering problems. There the A tuple corresponds to the parameters describing a system one wishes to control while the X tuple corresponds to the parameters one seeks in designing the controller. In this setting convexity is typically desired for numerical reasons and to guarantee that local optima are in fact global. Further motivation comes from the theories of matrix convexity and operator systems.

Recommendations

• Convex Noncommutative Polynomials Have Degree Two or Less
• Quasi-convex free polynomials
• Irreducible noncommutative defining polynomials for convex sets have degree 4 or less
• Noncommutative convexity arises from linear matrix inequalities
• Non-commutative partial matrix convexity

Cited in

(14)

• Non-commutative partial matrix convexity
• Noncommutative convexity arises from linear matrix inequalities
• Classification of all noncommutative polynomials whose Hessian has negative signature one and a noncommutative second fundamental form
• Bilinear matrix inequalities and polynomials in several freely noncommuting variables
• Convex Noncommutative Polynomials Have Degree Two or Less
• Irreducible noncommutative defining polynomials for convex sets have degree 4 or less
• Noncommutative partially convex rational functions
• Convex entire noncommutative functions are polynomials of degree two or less
• Symmetric functions of two noncommuting variables
• The Hessian of a noncommutative polynomial has numerous negative eigenvalues
• A non-commutative Positivstellensatz on isometries
• A nichtnegativstellensatz for polynomials in noncommuting variables
• Quasi-convex free polynomials
• Noncommutative partial convexity via \(\Gamma\)-convexity

This page was built for publication: Non-commutative polynomials with convex level slices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133345)