Reduced RLT representations for nonconvex polynomial programming problems (Q427362)
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 6046169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reduced RLT representations for nonconvex polynomial programming problems |
scientific article; zbMATH DE number 6046169 |
Statements
Reduced RLT representations for nonconvex polynomial programming problems (English)
0 references
13 June 2012
0 references
reformulation-linearization technique (RLT)
0 references
reduced basis techniques
0 references
polynomial programs
0 references
global optimization
0 references
semidefinite cuts
0 references
BARON
0 references
0 references
0 references
0 references
0 references
0 references
0.8275364637374878
0 references
0.8093825578689575
0 references
0.8044975399971008
0 references
