Checking local optimality in constrained quadratic programming is NP- hard (Q1102861): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(88)90049-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2039526985
@@ Property / OpenAlex ID: W2039526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138187
@@ Property / cites work: Q4138187 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Second Order Conditions for Constrained Minima
@@ Property / cites work: Second Order Conditions for Constrained Minima / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-complete problems in quadratic and nonlinear programming
+Normal rank
@@ Property / cites work @@
+Constrained global optimization: algorithms and applications
+Normal rank
@@ Property / cites work @@
+The complexity of analog computation
@@ Property / cites work: The complexity of analog computation / rank @@
+Normal rank