Checking local optimality in constrained quadratic programming is NP- hard (Q1102861): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(88)90049-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039526985 / rank | |||
Normal rank | |||
Revision as of 21:36, 19 March 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
