On convex relaxations for quadratically constrained quadratic programming (Q1925792): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-012-0602-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022026988 / rank | |||
Normal rank | |||
Revision as of 01:01, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convex relaxations for quadratically constrained quadratic programming |
scientific article |
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
