New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128)
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: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation |
scientific article; zbMATH DE number 7050497
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation |
scientific article; zbMATH DE number 7050497 |
Statements
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (English)
0 references
3 May 2019
0 references
quadratic programming
0 references
alternative direction method
0 references
convex relaxation
0 references
branch-and-bound
0 references
line search
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
0 references
