Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992)

In this paper, the author presents a new typical approach for solving the optimization of minimizing a polynomial optimization subject to polynomial constraints. The certificate for checking finite and asymptotical convergence of Lassees's hierarchy based on either Putinar's or Schmudgens's Positivstellensatz is established. The author also proves that flat truncation can be used as a certificate to check exactness of standard SOS relaxations and Jacobin SDP relaxations.