Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPT3 / rank | |||
Normal rank | |||
Revision as of 11:30, 28 February 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
