Tight sum-of-squares lower bounds for binary polynomial optimization problems (Q4598218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6820267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight sum-of-squares lower bounds for binary polynomial optimization problems |
scientific article; zbMATH DE number 6820267 |
Statements
19 December 2017
0 references
SoS/Lasserre hierarchy
0 references
lift and project methods
0 references
binary polynomial optimization
0 references
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. (English)
0 references
0.8172776699066162
0 references
0.8111330270767212
0 references
0.8085548281669617
0 references
