Checking local optimality in constrained quadratic programming is NP- hard (Q1102861): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4138187 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Second Order Conditions for Constrained Minima / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constrained global optimization: algorithms and applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of analog computation / rank | |||
Normal rank | |||
Latest revision as of 16:18, 18 June 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
