An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160)
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: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints |
scientific article; zbMATH DE number 6691691
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints |
scientific article; zbMATH DE number 6691691 |
Statements
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (English)
0 references
3 March 2017
0 references
quadratic programming
0 references
semidefinite relaxation
0 references
branch-and-bound
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
