Partial Lasserre relaxation for sparse Max-Cut
From MaRDI portal
Publication:6050383
DOI10.1007/s11081-022-09763-yMaRDI QIDQ6050383
Panos Parpas, Ruth Misener, Juan S. Campos
Publication date: 18 September 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Cites Work
- A dynamic inequality generation scheme for polynomial programming
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Experiments in quadratic 0-1 programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A multilevel analysis of the Lasserre hierarchy
- Algorithmic graph theory and perfect graphs
- On a positive semidefinite relaxation of the cut polytope
- Graphic vertices of the metric polytope
- A sublevel moment-SOS hierarchy for polynomial optimization
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Global Optimization with Polynomials and the Problem of Moments
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- BiqCrunch
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
