Quadratic programming with one negative eigenvalue is NP-hard (Q1177910): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56070241, #quickstatements; #temporary_batch_1707216511891 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56070241 / rank | |||
Normal rank | |||
Revision as of 13:34, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic programming with one negative eigenvalue is NP-hard |
scientific article |
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
