D.C. versus copositive bounds for standard QP (Q2583183): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-004-4312-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2020760300
@@ Property / OpenAlex ID: W2020760300 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-bound approaches to standard quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
+Normal rank
@@ Property / cites work @@
+On copositive programming and standard quadratic optimization problems
+Normal rank
@@ Property / cites work @@
+Approximation of the Stability Number of a Graph via Copositive Programming
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+A comparison of the Delsarte and Lovász bounds
@@ Property / cites work: A comparison of the Delsarte and Lovász bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank