Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903): Difference between revisions

@@ Property / arXiv ID @@
+math/0503174
@@ Property / arXiv ID: math/0503174 / rank @@
+Normal rank
@@ Property / cites work @@
+D.C. versus copositive bounds for standard QP
@@ Property / cites work: D.C. versus copositive bounds for standard QP / rank @@
+Normal rank
@@ Property / cites work @@
+Q3843714
@@ Property / cites work: Q3843714 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3371140
@@ Property / cites work: Q3371140 / rank @@
+Normal rank
@@ Property / cites work @@
+On copositive programming and 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 @@
+New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
+Normal rank
@@ Property / cites work @@
+Block diagonally dominant matrices and generalizations of the Gerschgorin circle theorem
+Normal rank