Solution Of The Truncated Complex Moment Problem For Flat Data

Solution of the Truncated Complex Moment Problem for Flat Data

We introduce a matricial approach to the truncated complex moment problem, and apply it to the case of moment matrices of flat data type, for which the columns corresponding to the homogeneous monomials in [italic]z and [italic]z̄ of highest degree can be written in terms of monomials of lower degree. We discuss the connection between complex moment problems and the subnormal completion problem for 2-variable weighted shifts, and present in detail the construction of solutions for truncated complex moment problems associated with monomials of degrees one and two.

Solution of the Truncated Complex Moment Problem for Flat Data

Optimization of Polynomials in Non-Commuting Variables

This book presents recent results on positivity and optimization of polynomials in non-commuting variables. Researchers in non-commutative algebraic geometry, control theory, system engineering, optimization, quantum physics and information science will find the unified notation and mixture of algebraic geometry and mathematical programming useful. Theoretical results are matched with algorithmic considerations; several examples and information on how to use NCSOStools open source package to obtain the results provided. Results are presented on detecting the eigenvalue and trace positivity of polynomials in non-commuting variables using Newton chip method and Newton cyclic chip method, relaxations for constrained and unconstrained optimization problems, semidefinite programming formulations of the relaxations and finite convergence of the hierarchies of these relaxations, and the practical efficiency of algorithms.