Identifying non-active restrictions in convex quadratic programming (Q1396999)
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: Identifying non-active restrictions in convex quadratic programming |
scientific article; zbMATH DE number 1950145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identifying non-active restrictions in convex quadratic programming |
scientific article; zbMATH DE number 1950145 |
Statements
Identifying non-active restrictions in convex quadratic programming (English)
0 references
16 July 2003
0 references
quadratic programming
0 references
redundancy
0 references
feasible point algorithms
0 references
active set strategy
0 references
