A feasible active set method for strictly convex quadratic problems with simple bounds (Q2945124)
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: A feasible active set method for strictly convex quadratic problems with simple bounds |
scientific article; zbMATH DE number 6479831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A feasible active set method for strictly convex quadratic problems with simple bounds |
scientific article; zbMATH DE number 6479831 |
Statements
A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (English)
0 references
9 September 2015
0 references
primal-dual active set methods
0 references
quadratic programming
0 references
box constraints
0 references
convex programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9327917695045472
0 references
0.8294939994812012
0 references
0.8109561204910278
0 references
0.7996219992637634
0 references
