SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
From MaRDI portal
Publication:1925791
DOI10.1007/S10107-012-0593-0zbMATH Open1257.90066OpenAlexW2029471744WikidataQ58002884 ScholiaQ58002884MaRDI QIDQ1925791FDOQ1925791
M. Piacentini, L. Palagi, L. Grippo, G. Rinaldi, Veronica Piccialli
Publication date: 19 December 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0593-0
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Benchmarks for Optimization Software
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Benchmarking optimization software with performance profiles.
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Laplacian eigenvalues and the maximum cut problem
- An independent benchmarking of SDP and SOCP solvers
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Problems of distance geometry and convex properties of quadratic maps
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Extremal correlation matrices
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- Semi-Definite Matrix Constraints in Optimization
- Solving the max-cut problem using eigenvalues
- Connection between semidefinite relaxations of the max-cut and stable set problems
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
- Solving a class of semidefinite programs via nonlinear programming
- A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
Cited In (7)
- SpeeDP
- Computational Approaches to Max-Cut
- A nonmonotone GRASP
- Title not available (Why is that?)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Using SVM to combine global heuristics for the standard quadratic problem
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
Uses Software
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)
