Positive polynomials in scalar and matrix variables, the spectral theorem and optimization
arXiv:math/0612103
Abstract
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several complex variables and modern operator theory. The second part of the survey focuses on recently discovered connections between real algebraic geometry and optimization as well as polynomials in matrix variables and some control theory problems. These new applications have prompted a series of recent studies devoted to the structure of positivity and convexity in a free *-algebra, the appropriate setting for analyzing inequalities on polynomials having matrix variables. We sketch some of these developments, add to them and comment on the rapidly growing literature.
106 pages, survey
References in corpus (4)
Cited by in corpus (13)
- Sums of hermitian squares and the BMV conjecture
- Positive maps and trace polynomials from the symmetric group
- Free Convex Algebraic Geometry
- Limitations of semidefinite programs for separable states and entangled games
- Semidefinite programming in matrix unknowns which are dimension free
- Algebras of Fractions and Strict Positivstellensätze for *-Algebras
- A real algebra perspective on multivariate tight wavelet frames
- A Striktpositivstellensatz for measurable functions (corrected version)
- Positivity and optimization for semi-algebraic functions
- Primal-dual interior-point Methods for Semidefinite Programming from an algebraic point of view, or: Using Noncommutativity for Optimization
- Non-Commutative Harmonic and Subharmonic Polynomials
- The operator Fejer-Riesz theorem
- Parameter Collapse due to the Zeros in the Inverse Condition