A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM

DOI10.1142/S0217595909002298zbMath1188.90225MaRDI QIDQ3638702

Jiuquan Ren, Feng-Min Xu, Cheng-Xian Xu

Publication date: 28 October 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

convergencemax-cut problemcontinuation approachfeasible direction algorithmNCP function

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
• 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
• An Interior-Point Method for Semidefinite Programming
• A survey of quasi-Newton equations and quasi-Newton methods for optimization

This page was built for publication: A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM