An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:55, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. |
scientific article |
Statements
An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (English)
0 references
24 August 2004
0 references
