Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+SQP algorithms for solving Toeplitz matrix approximation problem
+Normal rank
@@ Property / cites work @@
+Hybrid methods for approximating Hankel matrix
@@ Property / cites work: Hybrid methods for approximating Hankel matrix / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
+Normal rank
@@ Property / cites work @@
+The max-cut problem on graphs not contractible to \(K_ 5\)
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
+Normal rank
@@ Property / cites work @@
+Proximity Maps for Convex Sets
@@ Property / cites work: Proximity Maps for Convex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Restricted Least Squares Regression
+Normal rank
@@ Property / cites work @@
+Semi-Definite Matrix Constraints in Optimization
@@ Property / cites work: Semi-Definite Matrix Constraints in Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the nearest correlation matrix--a problem from finance
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved semidefinite bounding procedure for solving max-cut problems to optimality
+Normal rank
@@ Property / cites work @@
+A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
+Normal rank
@@ Property / cites work @@
+Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
+Normal rank
@@ Property / cites work @@
+Functional Operators (AM-22), Volume 2
@@ Property / cites work: Functional Operators (AM-22), Volume 2 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2298/fil1703737a
+Normal rank
@@ Property / OpenAlex ID @@
+W2214847929
@@ Property / OpenAlex ID: W2214847929 / rank @@
+Normal rank