Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
type: Item
instance of: scholarly article
title: Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
zbMATH Open document ID: 1346.90603
author: Felix Lieder
author: Fatemeh Bani Asadi Rad
author: Florian Jarre
published in: Computational Optimization and Applications
publication date: 2015-09-04T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6478551
zbMATH Keywords: MAX-cut relaxation
zbMATH Keywords: MAX-clique problem
zbMATH Keywords: semidefinite program
zbMATH Keywords: completely positive program
describes a project that uses: SDPT3
describes a project that uses: Biq Mac
MaRDI profile type: Publication
full work available at URL: s10589-015-9731-y
OpenAlex ID: W2001149695
cites work: Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
cites work: Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation
cites work: Q4247459
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets''
cites work: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Fixing Variables in Semidefinite Relaxations
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Burer's key assumption for semidefinite and doubly nonnegative relaxations
cites work: How Good is the Goemans--Williamson MAX CUT Algorithm?
cites work: Q5292090
cites work: On the Shannon capacity of a graph
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
DOI: 10.1007/S10589-015-9731-Y
description: scientific article; zbMATH DE number 6478551