A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743)
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 new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation |
scientific article; zbMATH DE number 7401550
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation |
scientific article; zbMATH DE number 7401550 |
Statements
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (English)
0 references
27 September 2021
0 references
quadratic programming
0 references
branch-and-cut algorithm
0 references
alternative direction method
0 references
semidefinite relaxation
0 references
computational complexity
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
0 references
0 references
