Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems |
scientific article; zbMATH DE number 6724122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems |
scientific article; zbMATH DE number 6724122 |
Statements
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (English)
0 references
30 May 2017
0 references
binary polynomial optimization problems
0 references
hierarchy of SDP relaxations
0 references
bound for the exact SDP relaxation
0 references
even-degree binary polynomial optimization problems
0 references
chordal graph
0 references
0 references
0 references
0 references
0 references
0 references
0.89609724
0 references
0.8928354
0 references
0 references
0.8919153
0 references
0.88839483
0 references
0.8865609
0 references
0.8857913
0 references
0 references
0.8836263
0 references
