Speaker: 黄磊博士，UCSD

Inviter: 王杰副研究员

Title: Tightness of the matrix Moment-SOS hierarchy

Language: Chinese

Time & Venue: 2024.06.26 14:00-15:00 S525

Abstract: In this talk, we consider the matrix Moment-SOS hierarchy for solving polynomial matrix optimization. Our first result is to show the tightness of this hierarchy, if the nondegeneracy condition, strict complementarity condition and second order sufficient condition hold at every minimizer, under the usual archimedeanness assumption. A useful criterion for detecting tightness is the flat truncation. Our second result is to show that every minimizer of the moment relaxation must have a flat truncation when the relaxation order is big enough, under the above mentioned optimality assumptions. These results give connections between nonlinear semidefinite optimization theory and Moment-SOS methods for solving polynomial matrix optimization.