Higher order maximum persistency and comparison theorems

4 years 4 months ago
Higher order maximum persistency and comparison theorems
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1 polynomial programming). For polyhedral relaxations of such problems it is generally not true that variables integer in the relaxed solution will retain the same values in the optimal discrete solution. Those which do are called persistent. Such persistent variables define a part of a globally optimal solution. Once identified, they can be excluded from the problem, reducing its size. To any polyhedral relaxation we associate a sufficient condition proving persistency of a subset of variables. We set up a specially constructed linear program which determines the set of persistent variables maximal with respect to the relaxation. The condition improves as the relaxation is tightened and possesses all its invariances. The proposed framework explains a...
Alexander Shekhovtsov
Added 01 Apr 2016
Updated 01 Apr 2016
Type Journal
Year 2016
Where CVIU
Authors Alexander Shekhovtsov
Comments (0)