SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
From MaRDI portal
Publication:1925791
Recommendations
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A projected gradient algorithm for solving the maxcut SDP relaxation
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
- A Spectral Bundle Method for Semidefinite Programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A projected gradient algorithm for solving the maxcut SDP relaxation
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An independent benchmarking of SDP and SOCP solvers
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Benchmarking optimization software with performance profiles.
- Benchmarks for Optimization Software
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Extremal correlation matrices
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Laplacian eigenvalues and the maximum cut problem
- Low-rank optimization on the cone of positive semidefinite matrices
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Problems of distance geometry and convex properties of quadratic maps
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Semi-Definite Matrix Constraints in Optimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving a class of semidefinite programs via nonlinear programming
- Solving the max-cut problem using eigenvalues
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
Cited in
(12)- Computational approaches to MAX-cut
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- A new global algorithm for max-cut problem with chordal sparsity
- Semidefinite programming based algorithms for the sparsest cut problem
- SpeeDP
- scientific article; zbMATH DE number 5957371 (Why is no real title available?)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- A nonmonotone GRASP
- Using SVM to combine global heuristics for the standard quadratic problem
This page was built for publication: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925791)
