Checking local optimality in constrained quadratic programming is NP- hard (Q1102861): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:44, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking local optimality in constrained quadratic programming is NP- hard |
scientific article |
Statements
Checking local optimality in constrained quadratic programming is NP- hard (English)
0 references
1988
0 references
indefinite quadratic programming
0 references
checking local optimality
0 references
NP-hard
0 references
locally strictly convex
0 references
