几乎对角形式的Lasserre族
The Lasserre Hierarchy in Almost Diagonal Form
摘要:
Lasserre层次结构是一个系统的过程,用于构建一系列越来越紧的松弛,捕获凸配方中使用的最佳可用的近似算法的各种优化问题。尽管越来越多的兴趣,有很少的技术来分析Lasserre完整性差距。满足半正定要求是构造Lasserre间隙例子的主要障碍之一。我们提出了一种新的表征的Lasserre层次结构的矩矩阵的基础上,不同的对角矩阵的秩一(几乎对角形式)。我们提供了一个模块化的配方,以获得半正定的可行性条件,通过迭代对角化秩一矩阵。利用这一点,我们证明了两个基本的能力覆盖问题的Lasserre层次的完整性差距的强下界。对于最小背包问题,我们表明,完整性差距仍然任意大,即使在级别$n-1$的Lasserre层次。对于最小和的延迟工件调度问题,我们证明了完整性差距是无界的水平$Ω(\sqrt{n})$(即使当目标函数集成为约束)。这些界限本身就很有趣,因为这两个问题都承认FPTAS。
英文摘要:
The Lasserre hierarchy is a systematic procedure for constructing a sequence of increasingly tight relaxations that capture the convex formulations used in the best available approximation algorithms for a wide variety of optimization problems. Despite the increasing interest, there are very few techniques for analyzing Lasserre integrality gaps. Satisfying the positive semi-definite requirement is one of the major hurdles to constructing Lasserre gap examples. We present a novel characterization of the Lasserre hierarchy based on moment matrices that differ from diagonal ones by matrices of rank one (almost diagonal form). We provide a modular recipe to obtain positive semi-definite feasibility conditions by iteratively diagonalizing rank one matrices. Using this, we prove strong lower bounds on integrality gaps of Lasserre hierarchy for two basic capacitated covering problems. For the min-knapsack problem, we show that the integrality gap remains arbitrarily large even at level $n-1$ of Lasserre hierarchy. For the min-sum of tardy jobs scheduling problem, we show that the integrality gap is unbounded at level $Ω(\sqrt{n})$ (even when the objective function is integrated as a constraint). These bounds are interesting on their own, since both problems admit FPTAS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。