Exploiting term sparsity in noncommutative polynomial optimization
Exploiting term sparsity in noncommutative polynomial optimization
We provide a new hierarchy of semidefinite programming relaxations, called NCTSSOS, to solve large-scale sparse noncommutative polynomial optimization problems.This hierarchy features the exploitation of term sparsity hidden in the input data for eigenvalue and trace optimization problems.NCTSSOS complements the recent work that exploits correlative sparsity for noncommutative optimization problems by …