A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem

Keyphrases

• Contractive 100%
• Doubly Nonnegative Relaxation 100%
• Minimum Cut Problem 100%
• Vertex Separator Problem 100%
• Peaceman-Rachford Splitting Method 100%
• Approximate Solution 50%
• Eigenvalues 50%
• Edge Cut 50%
• Semidefinite Programming 50%
• Number of Edges 50%
• Splitting Method 50%
• Early Termination 50%
• Algorithmic Approach 50%
• Facial Reduction 50%
• Doubly Nonnegative 50%
• K-subsets 50%
• Strong Relaxation 50%
• Redundant Constraints 50%
• Bounding Technique 50%
• Gangster 50%

Mathematics

• Contractive 100%
• Upper Bound 50%
• Edge 50%
• Approximates 50%
• Minimizes 50%
• Lower and upper bounds 50%
• Deep Neural Network 50%
• Eigenvalue 50%
• Approximate Solution 50%
• Subproblem 50%