Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612)
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: Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts |
scientific article; zbMATH DE number 6087670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts |
scientific article; zbMATH DE number 6087670 |
Statements
Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (English)
0 references
27 September 2012
0 references
polynomial programs
0 references
reformulation-linearization technique
0 references
semidefinite programming
0 references
BARON
0 references
GloptiPoly
0 references
semidefinite cuts
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8670138120651245
0 references
0.798182487487793
0 references
0.7954076528549194
0 references
0.7894248962402344
0 references
0.7850745320320129
0 references
