Real ideal and the duality of semidefinite programming for polynomial optimization

摘要

We study the ideal generated by polynomials vanishing on a semialgebraic set and give elementary proofs for some equivalent conditions for reality of ideals or S-radical ideals. These results can be applied for modifying polynomial optimization problems so that the associated semidefinite programming relaxation problems have no duality gap.