Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57445430, #quickstatements; #temporary_batch_1710702420720 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10589-012-9522-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004620147 / rank | |||
Normal rank | |||
Revision as of 22:58, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tightening a copositive relaxation for standard quadratic optimization problems |
scientific article |
Statements
Tightening a copositive relaxation for standard quadratic optimization problems (English)
0 references
26 June 2013
0 references
standard quadratic optimization problem
0 references
Shor's relaxation
0 references
semidefinite programming
0 references
duality gap
0 references
minimal vertex cover
0 references
second-order cone program
0 references
