Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292): 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/s10589-013-9618-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139767903 / rank | |||
Normal rank | |||
Revision as of 18:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster, but weaker, relaxations for quadratically constrained quadratic programs |
scientific article |
Statements
Faster, but weaker, relaxations for quadratically constrained quadratic programs (English)
0 references
18 September 2014
0 references
nonconvex quadratic programming
0 references
semidefinite programming
0 references
second-order cone programming
0 references
difference of convex
0 references
