On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-021-01714-2
@@ Property / DOI: 10.1007/s10107-021-01714-2 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3048750752
@@ Property / OpenAlex ID: W3048750752 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05558
@@ Property / arXiv ID: 2008.05558 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of detecting convexity over a box
+Normal rank
@@ Property / cites work @@
+Complexity aspects of local minima and related notions
+Normal rank
@@ Property / cites work @@
+Approximation of the Stability Number of a Graph via Copositive Programming
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial solvability of convex quadratic programming
+Normal rank
@@ Property / cites work @@
+On the solution of concave knapsack problems
@@ Property / cites work: On the solution of concave knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Checking local optimality in constrained quadratic programming is NP- hard
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+Open questions in complexity theory for numerical optimization
+Normal rank
@@ Property / cites work @@
+Quadratic programming is in NP
@@ Property / cites work: Quadratic programming is in NP / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10107-021-01714-2
@@ Property / DOI: 10.1007/S10107-021-01714-2 / rank @@
+Normal rank