Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
From MaRDI portal
Publication:5737720
Recommendations
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Semidefinite programming relaxations for linear semi-infinite polynomial programming
- Bilevel polynomial programs and semidefinite relaxation methods
- Semidefinite relaxations for semi-infinite polynomial programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- A semidefinite approach for truncated \(K\)-moment problems
- Solving polynomial least squares problems via semidefinite programming relaxations
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Semidefinite programming in combinatorial and polynomial optimization
Cites work
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Approximation algorithms for discrete polynomial optimization
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Global optimization with polynomials and the problem of moments
- Graph theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- On a conjecture concerning spanning tree invariants and loop systems
- On solving biquadratic optimization via semidefinite relaxation
- On the hardest problem formulations for the \(0/1\) Lasserre hierarchy
- Polynomially solvable cases for the maximum stable set problem
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Tight sum-of-squares lower bounds for binary polynomial optimization problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(12)- Lower bounds of functions on finite abelian groups
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Sum-of-squares bounds via Boolean function analysis
- An exact Jacobian SDP relaxation for polynomial optimization
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- The Spectrum of the Grigoriev–Laurent Pseudomoments
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
This page was built for publication: Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737720)
