Quadratic programming with one negative eigenvalue is NP-hard (Q1177910): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
+Normal rank
@@ Property / cites work @@
+Methods for Global Concave Minimization: A Bibliographic Survey
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+Checking local optimality in constrained quadratic programming is NP- hard
+Normal rank
@@ Property / cites work @@
+Quadratic programming is in NP
@@ Property / cites work: Quadratic programming is in NP / rank @@
+Normal rank