Partial Lasserre relaxation for sparse Max-Cut
From MaRDI portal
Publication:6050383
Cites work
- A dynamic inequality generation scheme for polynomial programming
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- A multilevel analysis of the Lasserre hierarchy
- A new sparse SOS decomposition algorithm based on term sparsity
- A sublevel moment-SOS hierarchy for polynomial optimization
- Algorithmic graph theory and perfect graphs
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Experiments in quadratic 0-1 programming
- Global optimization with polynomials and the problem of moments
- Graphic vertices of the metric polytope
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Linear programming relaxations of quadratically constrained quadratic programs
- On a positive semidefinite relaxation of the cut polytope
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
This page was built for publication: Partial Lasserre relaxation for sparse Max-Cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050383)
