Active constraints, indefinite quadratic test problems, and complexity (Q911993)
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: Active constraints, indefinite quadratic test problems, and complexity |
scientific article; zbMATH DE number 4143781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Active constraints, indefinite quadratic test problems, and complexity |
scientific article; zbMATH DE number 4143781 |
Statements
Active constraints, indefinite quadratic test problems, and complexity (English)
0 references
1991
0 references
The observation that at least s constraints are active when the Hessian of the Lagrangian has s negative eigenvalues at a local minimizer is used to obtain two results: (i) a class of nearly-concave quadratic minimization problem can be solved in polynomial time; (ii) a class of indefinite quadratic test problems can be constructed with a specified number of positive and negative eigenvalues and with a known global minimizer.
0 references
active constraints
0 references
complexity theory
0 references
negative eigenvalues
0 references
local minimizer
0 references
nearly-concave quadratic minimization
0 references
polynomial time
0 references
indefinite quadratic test problems
0 references
global minimizer
0 references
0 references
0 references
0.8828977
0 references
0.87878567
0 references
0.86981636
0 references
0.86951745
0 references
0.86896765
0 references
0.8655522
0 references
0.8626619
0 references
0.86064714
0 references
