A Characterization for Ti
A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
This paper studies the sparse Moment-SOS hierarchy of relaxations for solving sparse polynomial optimization problems. We show that this sparse hierarchy is tight if and only if the objective can be written as a sum of sparse nonnegative polynomials, each of which belongs to the sum of the ideal and…