Global convergence of the alternating projection method for the Max-Cut relaxation problem

DOI10.2298/FIL1703737AzbMath1488.49031OpenAlexW2214847929MaRDI QIDQ5005866

Suliman Al-Homidan

Publication date: 11 August 2021

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1703737a

zbMATH Keywords

global convergencemax-cut problemalternating projections method

Mathematics Subject Classification ID

Numerical methods (including Monte Carlo methods) (91G60) Methods involving semicontinuity and convergence; relaxation (49J45)

Uses Software

• Biq Mac

Cites Work

• Unnamed Item
• Computing the nearest correlation matrix--a problem from finance
• The max-cut problem on graphs not contractible to \(K_ 5\)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Hybrid methods for approximating Hankel matrix
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• Proximity Maps for Convex Sets
• An Algorithm for Restricted Least Squares Regression
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• Semi-Definite Matrix Constraints in Optimization
• On Projection Algorithms for Solving Convex Feasibility Problems
• Reducibility among Combinatorial Problems
• SQP algorithms for solving Toeplitz matrix approximation problem
• Functional Operators (AM-22), Volume 2
• Geometry of cuts and metrics

This page was built for publication: Global convergence of the alternating projection method for the Max-Cut relaxation problem