Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-013-0647-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-013-0647-0 / rank | |||
Normal rank | |||
Latest revision as of 17:01, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints |
scientific article |
Statements
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (English)
0 references
30 April 2014
0 references
convex quadratic program with linear complementarity constraints
0 references
semidefinite program
0 references
quadratic convex reformulation
0 references
quadratically constrained quadratic program
0 references
0 references
0 references
