Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems (Q3156718): Difference between revisions

@@ Property / cites work @@
+An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
+Normal rank
@@ Property / cites work @@
+A graph-theoretic via minimization algorithm for two-layer printed circuit boards
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
+Normal rank
@@ Property / cites work @@
+A projected gradient algorithm for solving the maxcut SDP relaxation
+Normal rank
@@ Property / cites work @@
+A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
+Normal rank
@@ Property / cites work @@
+Problems of distance geometry and convex properties of quadratic maps
+Normal rank
@@ Property / cites work @@
+On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
+Normal rank