Quadratic programming with one negative eigenvalue is NP-hard (Q1177910)
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: Quadratic programming with one negative eigenvalue is NP-hard |
scientific article; zbMATH DE number 22479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic programming with one negative eigenvalue is NP-hard |
scientific article; zbMATH DE number 22479 |
Statements
Quadratic programming with one negative eigenvalue is NP-hard (English)
0 references
26 June 1992
0 references
global optimization
0 references
concave quadratic function
0 references
NP-hard
0 references
0 references
