Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction (Q2052380): Difference between revisions

Lasserre's relaxation hierarchy is employed for solving the problem of minimizing a polynomial over a basic closed semialgebraic subset of an Euclidean space. A new certificate for the optimal value of a Lasserre relaxation to be the optimal value of the considered polynomial optimization problem consisting in checking whether a certain matrix has a generalized Hankel form is provided. This certificate is more general than its known counterparts. When optimality is detected, the potential minimizers are extracted by means of a truncated version of the Gelfand-Naimark-Segal construction on the optimal solution of the Lasserre relaxation and the author shows that the operators of this truncated construction commute if and only if the matrix of this modified optimal solution is generalized Hankel. A result of Curto and Fialkow on the existence of a quadrature rule if the optimal solution is flat and a result of Xu and Mysovskikh on the existence of a Gaussian quadrature rule if the modified optimal solution is a generalized Hankel matrix are rediscovered afterwards by means of the new method. A numerical linear algebraic algorithm for detecting optimality and extracting solutions of a polynomial optimization problem is proposed, too, while several examples illustrate the theoretical achievements.