SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
type: Item
instance of: scholarly article
title: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
zbMATH Open document ID: 1257.90066
author: L. Palagi
author: M. Piacentini
author: G. Rinaldi
author: L. Grippo
author: Veronica Piccialli
published in: Mathematical Programming. Series A. Series B
publication date: 2012-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6116940
zbMATH Keywords: low rank factorization
zbMATH Keywords: unconstrained binary quadratic programming
zbMATH Keywords: max-cut
zbMATH Keywords: nonlinear programming
cites work: Benchmarks for Optimization Software
cites work: Problems of distance geometry and convex properties of quadratic maps
cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
cites work: Q3151174
cites work: Solving a class of semidefinite programs via nonlinear programming
cites work: A projected gradient algorithm for solving the maxcut SDP relaxation
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
cites work: Semi-Definite Matrix Constraints in Optimization
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
cites work: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
cites work: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
cites work: Extremal correlation matrices
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems
cites work: Connection between semidefinite relaxations of the max-cut and stable set problems
cites work: Q4668573
cites work: An independent benchmarking of SDP and SOCP solvers
cites work: A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
cites work: Solving the max-cut problem using eigenvalues
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: Rudy
describes a project that uses: SDPLR
describes a project that uses: Biq Mac
describes a project that uses: COL
MaRDI profile type: Publication
full work available at URL: s10107-012-0593-0
OpenAlex ID: W2029471744
Wikidata QID: Q58002884
DOI: 10.1007/S10107-012-0593-0
description: scientific article; zbMATH DE number 6116940