A continuation algorithm for max-cut problem (Q2644353): Difference between revisions

@@ Property / author @@
+Feng-Min Xu
@@ Property / author: Feng-Min Xu / rank @@
+Normal rank
@@ Property / author @@
+Cheng-Xian Xu
@@ Property / author: Cheng-Xian Xu / rank @@
+Normal rank
@@ Property / author @@
+Xing-Si Li
@@ Property / author: Xing-Si Li / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CirCut
@@ Property / describes a project that uses: CirCut / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SDPpack
@@ Property / describes a project that uses: SDPpack / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SDPLR
@@ Property / describes a project that uses: SDPLR / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10114-005-0881-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1989684904
@@ Property / OpenAlex ID: W1989684904 / rank @@
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
+Normal rank
@@ Property / cites work @@
+Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
+Normal rank
@@ Property / cites work @@
+Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
+Normal rank
@@ Property / cites work @@
+The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
+Normal rank
@@ Property / cites work @@
+Q4658633
@@ Property / cites work: Q4658633 / rank @@
+Normal rank
@@ Property / cites work @@
+Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
+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 @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+A Spectral Bundle Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
+Normal rank
@@ Property / cites work @@
+An Interior-Point Method for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+A special newton-type optimization method
@@ Property / cites work: A special newton-type optimization method / rank @@
+Normal rank
@@ Property / cites work @@
+A tight semidefinite relaxation of the MAX CUT problem
+Normal rank