Quadratic programming with one negative eigenvalue is NP-hard

Some NP-complete problems in quadratic and nonlinear programming

Katta G. Murty, Santosh N. Kabadi · Mathematical Programming · 1987 · 1K citations

Natural Sciences, Computer Science, Mathematics +14

Computationally Related Problems

Sartaj Sahni · SIAM Journal on Computing · 1974 · 362 citations

Computing, Computer Science, Mathematics +16

The polynomial solvability of convex quadratic programming

M.K. Kozlov, S. Yu. Tarasov, Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 356 citations

Natural Sciences, Computer Science, Mathematics +12

Checking local optimality in constrained quadratic programming is NP-hard

Pãnos M. Pardalos, Georg Schnitger · Operations Research Letters · 1988 · 186 citations

Natural Sciences, Computer Science, Algorithms +10

Methods for Global Concave Minimization: A Bibliographic Survey

Pãnos M. Pardalos, J. B. Rosen · SIAM Review · 1986 · 177 citations

Natural Sciences, Mathematics, Computational Geometry +12