Checking local optimality in constrained quadratic programming is NP- hard (Q1102861)
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: Checking local optimality in constrained quadratic programming is NP- hard |
scientific article; zbMATH DE number 4051353
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking local optimality in constrained quadratic programming is NP- hard |
scientific article; zbMATH DE number 4051353 |
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
0.8790244
0 references
0.8701259
0 references
0.86983263
0 references
0.86930525
0 references
0.86865056
0 references
0.86837673
0 references
0.8654096
0 references
