An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. (Q1875003)
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: An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. |
scientific article; zbMATH DE number 2094857
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints. |
scientific article; zbMATH DE number 2094857 |
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
0.90818524
0 references
0.9041109
0 references
0.89583105
0 references
0.89355135
0 references
0.8916084
0 references
0.89137524
0 references
0.8896904
0 references
0.8892329
0 references
