加载中…
We revisit Stengle’s classical univariate polynomial optimization example whose constraint description is degenerate at the minimizers. We prove that the moment-SOS hierarchy of relaxation order has the exact value . For this we construct in rational arithmetic a dual polynomial sum-of-squares (SOS) certificate and a primal moment sequence representing a finitely atomic measure. The key ingredients are elementary trigonometric properties of Chebyshev and Gegenbauer polynomial, and a Christoffel-Darboux kernel argument.

生成讲解博客的中文版本

生成AI智能校验的中文版本