I have an optimization problem with vectors $x$, $y$, and $z$, where $x$ is an integer vector. My objective function is linear (i.e. $\|y\|_1$), but one of my constraints is quadratic ($x^Ty \leq z$). The other constraints are all linear. In addition, I have equality and inequality constraints. What methods are there to optimize this?

I see two options:

  • Convex optimization methods (but they might be inefficient, given that my loss is linear.
  • Use methods for quadratic objectives and just use them with linear objective functions.

Google mostly lists proprietary software instead of papers to read.

Any better suggestions that are explicitly made for QCMILP (quadratically constrained mixed integer linear programs?

  • 2
    $\begingroup$ Having a linear objective won't particularly help. Actually, you can always reformulate a QCQP to have a linear objective by minimizing $z$ subject to $z = \mathrm{obj}$. However, having a single quadratic constraint should favor methods based on linear approximations, which are the ones usually implemented by exact MIQCQP solvers (Gurobi, Cplex...) $\endgroup$
    – fontanf
    Mar 1 at 8:33
  • 3
    $\begingroup$ Maybe not useful, but $x^Ty\le z$ can be linearized (with some effort) using the fact that $x$ is integer-valued. (Hint: Expand using binary variables and then linearize the terms). $\endgroup$ Mar 1 at 15:46
  • $\begingroup$ I don't think solvers like Cplex and Gurobi will automatically linearize quadratic terms with general integer variables, but only with binary variables. $\endgroup$ Mar 1 at 16:03
  • 2
    $\begingroup$ The quadratic constraint, $x^T y \leq z$, is not convex in general as the Hessian is indefinite. Please update your question to reflect this. $\endgroup$ Mar 2 at 12:50

1 Answer 1


Gurobi can solve mixed integer quadratically constrained problems provided that your known values in the quadratic constraint form positive semidefinite matrix. You'd need to use Quadratic Constraint to model the constraints. Gurobi will linearly relax using either interior points or outer approximation.

  • 1
    $\begingroup$ Gurobi can also solve non-convex MIQCQPs after setting the NonConvex Parameter accordingly. So the matrix doesn't need to be positive semidefinite. $\endgroup$
    – joni
    Mar 3 at 7:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.