Skip to main content

Stationary point for non-convex QCQP?



1 comment

  • Jaromił Najman
    Gurobi Staff Gurobi Staff

    Hi Jonathan,

    It is currently not possible to use the Barrier algorithm in order to solve a non-convex QCQP to get a local minimum. Please also note that the feasible solution point found by the spatial B&B algorithm is currently not guaranteed to be a stationary point.

    You could get the solution of the convex relaxation of a non-convex QCQP by solving the root relaxation and then getting the relaxation solution point from a \(\texttt{MIPNODE}\) callback.

    Best regards,


Please sign in to leave a comment.