An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AAFAC / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 06:01, 5 March 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
