对称公式的平方和层次下界
Sum-of-squares hierarchy lower bounds for symmetric formulations
摘要:
我们介绍了一种方法证明平方和(SoS)/ Lasserre层次下界时,初始问题的制定表现出高度的对称性。我们的主要技术定理,使我们能够减少研究的半正定分析的“良好的”一元多项式不等式。我们说明了两个问题上的技术,一个无约束和其他的约束。更确切地说,我们给出了求完全图的整数截多面体的Grigoriev/Laurent下界的一个简单初等证明。我们还表明,SoS层次结构需要一个非常数的轮数,以提高初始完整性差距为2的最小背包线性规划加强覆盖不等式。
英文摘要:
We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive semidefiniteness to the analysis of "well-behaved" univariate polynomial inequalities. We illustrate the technique on two problems, one unconstrained and the other with constraints. More precisely, we give a short elementary proof of Grigoriev/Laurent lower bound for finding the integer cut polytope of the complete graph. We also show that the SoS hierarchy requires a non-constant number of rounds to improve the initial integrality gap of 2 for the Min-Knapsack linear program strengthened with cover inequalities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。