We show that a separable polynomial program involving a box constraint enjoys a dual problem, that can be displayed in terms of sums of squares univariate polynomials. Under convexification and qualification conditions, we prove that a strong duality relation between the underlying separable polynomial problem and its corresponding dual holds, where the dual problem can be reformulated and solved as a semidefinite programming problem.

中文翻译：

---

涉及盒约束的可分离多项式程序的半定程序对偶

我们展示了一个包含框约束的可分离多项式程序有一个对偶问题，可以用单变量多项式的平方和来表示。在凸化和限定条件下，我们证明了潜在可分离多项式问题与其对应的对偶之间的强对偶关系，其中对偶问题可以重新表述为半定规划问题并解决。