Convergence rates of S.O.S hierarchies for polynomial semidefinite
programs
Convergence rates of S.O.S hierarchies for polynomial semidefinite
programs
We introduce a S.O.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite condition. Our approach involves utilizing a penalty function framework to directly address the matrix-based constraint, making it applicable to both discrete and continuous polynomial optimization problems. We investigate …