A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
DOI10.1007/S10589-020-00261-4zbMATH Open1465.05146OpenAlexW3125711631MaRDI QIDQ2028477FDOQ2028477
Authors: Xin-Xin Li, Ting Kei Pong, Hao Sun, Henry Wolkowicz 
Publication date: 1 June 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00261-4
Recommendations
- The MIN-cut and vertex separator problem
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Application of the strictly contractive Peaceman-Rachford splitting method to multi-block separable convex programming
graph partitioningvertex separatorsemidefinite relaxationdoubly nonnegative relaxationfacial reductionmin-cutpeaceman-Rachford splitting method
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Semidefinite programming (90C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- ADMM for the SDP relaxation of the QAP
- ADMM_QAP
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Title not available (Why is that?)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A semidefinite programming approach to side chain positioning with new rounding strategies
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Regularity and Stability for Convex Multivalued Functions
- Semidefinite programming relaxations for the quadratic assignment problem
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- Convergence study on the symmetric version of ADMM with larger step sizes
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- A multilevel bilinear programming algorithm for the vertex separator problem
- Semidefinite programming relaxations for the graph partitioning problem
- An exact algorithm for solving the vertex separator problem
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- The MIN-cut and vertex separator problem
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- Bandwidth, vertex separators, and eigenvalue optimization
- Title not available (Why is that?)
Cited In (6)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- A note on the SDP relaxation of the minimum cut problem
- Partitioning through projections: strong SDP bounds for large graph partition problems
Uses Software
This page was built for publication: A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028477)
