On convex relaxations for quadratically constrained quadratic programming (Q1925792)
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: On convex relaxations for quadratically constrained quadratic programming |
scientific article; zbMATH DE number 6116941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On convex relaxations for quadratically constrained quadratic programming |
scientific article; zbMATH DE number 6116941 |
Statements
On convex relaxations for quadratically constrained quadratic programming (English)
0 references
19 December 2012
0 references
A quadratically constrained (possibly non-convex) quadratic programming problem is considered. The efficiency, for this problem, of several known convex underestimating methods is analyzed. The underestimates, obtained by means of the considered methods, are ranked according to their tightness.
0 references
quadratic programming
0 references
quadratic constrains
0 references
convex underestimate
0 references
reformulation-linearization
0 references
0 references
0 references
0 references
0 references
0 references
0.97387844
0 references
0.97103345
0 references
0.96645296
0 references
0.9532708
0 references
0.9498474
0 references
0.9457371
0 references
0.9448547
0 references
0.94241893
0 references
