A sparse noncommutative Positivstellensatz and sparse GNS extraction are proved, giving converging SDP hierarchies for eigenvalue and trace optimization under a running-intersection sparsity pattern.
Anjos and Jean B
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sparse Noncommutative Polynomial Optimization
A sparse noncommutative Positivstellensatz and sparse GNS extraction are proved, giving converging SDP hierarchies for eigenvalue and trace optimization under a running-intersection sparsity pattern.