27 citations · 187 across the 36 of their papers we have counts for
1 paper · 1 filter
John Fearnley, Paul W. Goldberg, Alexandros Hollender +1
It is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, i…