A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINOS / rank | |||
Normal rank | |||
Revision as of 12:57, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reformulation-convexification approach for solving nonconvex quadratic programming problems |
scientific article |
Statements
A reformulation-convexification approach for solving nonconvex quadratic programming problems (English)
0 references
8 February 1996
0 references
reformulation-linearization/convexification technique
0 references
outer-approximations
0 references
tight linear programming relaxations
0 references
linearly constrained nonconvex quadratic programming
0 references
