Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPLR / rank | |||
Normal rank | |||
Revision as of 12:46, 29 February 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
