Abstract
The Max-Cut problem is an NP-hard problem [15]. Extensions of von Neumann?s alternating projections method permit the computation of proximity projections onto convex sets. The present paper exploits this fact by constructing a globally convergent method for the Max-Cut relaxation problem. The feasible set of this relaxed Max-Cut problem is the set of correlation matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
