On the $\Omega(n)$ SDP relaxation gap for Submodular Box-Constrained Quadratic Programming
Continuous submodular optimization is an important class of nonconvex problems with global guarantees, for which the submodular box-constrained quadratic programming (BCQP) forms a fundamental subclass. It arises naturally as quadratic subproblems of general twice-differentiable submodular problems and also has direct...