SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

We present a new approach, requiring the solution of a SemiDefinite Program, for decomposing the Hessian of a nonseparable Mixed-Integer Quadratic problem to permit using perspective cuts to improve its continuous relaxation bound. The new method favorably compares with a previously proposed one requiring a minimum eigenvalue computation.