A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs |
scientific article |
Statements
A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (English)
0 references
12 November 2021
0 references
second order cone programming relaxation
0 references
semidefinite programming relaxation
0 references
nonconvex quadratic program
0 references
branch-and-bound algorithm
0 references
difference of convex decomposition
0 references
0 references
0 references
0 references
0 references
0 references
