An exact Jacobian SDP relaxation for polynomial optimization (Q1942264)

This paper proposes the exact semidefinite programming (SDP) relaxation and its dual for polynomial optimization by using the Jacobian of its defining polynomials. A drawback of the proposed relaxation and its dual is that there are many new constraints. This would make the computation very difficult to implement in some cases. Thus, this method is more interesting theoretically. However, the author discovers an important fact: It is possible to solve the polynomial optimization exactly by a single SDP relaxation.