A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:05, 1 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
