A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs (Q2835666): Difference between revisions

@@ Property / describes a project that uses @@
+CSDP
@@ Property / describes a project that uses: CSDP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3105236435
@@ Property / OpenAlex ID: W3105236435 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02566
@@ Property / arXiv ID: 1603.02566 / rank @@
+Normal rank
@@ Property / cites work @@
+CSDP, A C library for semidefinite programming
@@ Property / cites work: CSDP, A C library for semidefinite programming / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations for non-convex quadratic mixed-integer programming
+Normal rank
@@ Property / cites work @@
+Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+The polynomial solvability of convex quadratic programming
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Quadratic programming with one negative eigenvalue is NP-hard
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank