Sparse Noncommutative Polynomial Optimization

Understand

This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data.

• A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided.
• This hierarchy is a noncommutative analogue of results due to Lasserre [SIAM J.
• Optim.