Relaxing the optimality conditions of box QP (Q538311): Difference between revisions

@@ Property / cites work @@
+Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
+Normal rank
@@ Property / cites work @@
+Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
+Normal rank
@@ Property / cites work @@
+Q4352739
@@ Property / cites work: Q4352739 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997222
@@ Property / cites work: Q3997222 / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimization algorithms for linearly constrained indefinite quadratic problems
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+Q3802887
@@ Property / cites work: Q3802887 / rank @@
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank
@@ Property / cites work @@
+A polyhedral study of nonconvex quadratic programs with box constraints
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
+Normal rank
@@ Property / cites work @@
+Approximating quadratic programming with bound and quadratic constraints
+Normal rank