Sparse convex relaxations in polynomial optimization

Gennadiy Averkov, Benjamin Peters, Sebastian Sager

We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquito…