Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization

Igor Klep, Victor Magron, Tobias Metzlaff +1

Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programmi…