A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230)
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 class of methods for solving large, convex quadratic programs subject to box constraints |
scientific article; zbMATH DE number 20090
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of methods for solving large, convex quadratic programs subject to box constraints |
scientific article; zbMATH DE number 20090 |
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
0 references
0 references
