A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:43, 29 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of methods for solving large, convex quadratic programs subject to box constraints |
scientific article |
Statements
A class of methods for solving large, convex quadratic programs subject to box constraints (English)
0 references
26 June 1992
0 references
conjugate gradient-type algorithms
0 references
box constraints
0 references
sparse large-scale programming
0 references
