Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
From MaRDI portal
Publication:2307758
DOI10.1007/s10898-019-00813-xzbMath1464.90050OpenAlexW2964435736MaRDI QIDQ2307758
Florian Jarre, Ya-Feng Liu, Felix Lieder, Cheng Lu
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00813-x
Related Items
A new global algorithm for max-cut problem with chordal sparsity ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ A branch-and-bound algorithm for solving max-\(k\)-cut problem
Uses Software
Cites Work
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Relaxations of vertex packing
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Global Optimization with Polynomials and the Problem of Moments
- Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure
- Copositive Programming
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- On the complexity of purely complex μ computation and related problems in multidimensional systems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Transmit beamforming for physical-layer multicasting
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Complex Matrix Decomposition and Quadratic Programming
- Extended Matrix Cube Theorems with Applications to μ-Theory in Control
- On the irreducibility, self-duality an non-homogeneity of completely positive cones
