On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624): Difference between revisions

The authors consider semidefinite reformulations of 0-1 quadratic problems (with linear or quadratic constraints) as well as semi-definite bounds obtained by Lagrangian duality. The main result of this paper is the study of such semi-definite bounds including conclusions for solution methods. Finally, computational results and a corresponding discussion is presented.