Skip to main content

and
  1. No Access

    Article

    SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs

    We consider the global optimization of nonconvex mixed-integer quadratic programs with linear equality constraints. In particular, we present a new class of convex quadratic relaxations which are derived via q...

    Carlos J. Nohra, Arvind U. Raghunathan, Nikolaos V. Sahinidis in Mathematical Programming (2022)