A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CUTEr / rank | |||
Normal rank | |||
Revision as of 06:38, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds |
scientific article |
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
