Quadratic programming with one negative eigenvalue is NP-hard

Quadratic programming with one negative eigenvalue is NP-hard | Litlas