A class of methods for solving large, convex quadratic programs subject to box constraints (Q1177230): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A sparse sequential quadratic programming algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The conjugate gradient method in extremal problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A class of methods for solving large, convex quadratic programs subject to box constraints / rank | |||
Normal rank | |||
Latest revision as of 10:27, 15 May 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
0 references
0 references
