Log Fire

Sparse Polynomial Optimi

Sparse Polynomial Optimiz
Sparse Polynomial Optimization with Matrix Constraints

This paper studies the hierarchy of sparse matrix Moment-SOS relaxations for solving sparse polynomial optimization problems with matrix constraints. First, we prove a sufficient and necessary condition for the sparse hierarchy to be tight. Second, we discuss how to detect the tightness and extract …

Similar Posts

Leave a Reply

Your email address will not be published. Required fields are marked *