Pages that link to "Item:Q5737720"
From MaRDI portal
The following pages link to Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720):
Displaying 12 items.
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel (Q5051374) (← links)
- (Q5091238) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903) (← links)
- The Spectrum of the Grigoriev–Laurent Pseudomoments (Q6187076) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time (Q6657418) (← links)
