A continuation algorithm for max-cut problem
From MaRDI portal
Publication:2644353
DOI10.1007/s10114-005-0881-1zbMath1117.90049OpenAlexW1989684904MaRDI QIDQ2644353
Xing-Si Li, Feng-Min Xu, Cheng-Xian Xu
Publication date: 31 August 2007
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-005-0881-1
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A tight semidefinite relaxation of the MAX CUT problem
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- An improved rounding method and semidefinite programming relaxation for graph partition
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- P-Complete Approximation Problems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A special newton-type optimization method
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
- An Interior-Point Method for Semidefinite Programming
