Semidefinite Programming vs. LP Relaxations for Polynomial Programming (Q5704081)
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: Semidefinite Programming vs. LP Relaxations for Polynomial Programming |
scientific article; zbMATH DE number 2228248
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite Programming vs. LP Relaxations for Polynomial Programming |
scientific article; zbMATH DE number 2228248 |
Statements
Semidefinite Programming vs. LP Relaxations for Polynomial Programming (English)
0 references
11 November 2005
0 references
global optimization
0 references
real algebraic geometry
0 references
semidefinite relaxations
0 references
LP relaxations
0 references
