A new algorithm for the general quadratic programming problems with box constraints (Q5962186): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s11075-009-9358-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11075-009-9358-0 / rank | |||
Normal rank | |||
Latest revision as of 12:26, 9 December 2024
scientific article; zbMATH DE number 5789597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the general quadratic programming problems with box constraints |
scientific article; zbMATH DE number 5789597 |
Statements
A new algorithm for the general quadratic programming problems with box constraints (English)
0 references
21 September 2010
0 references
box constraints
0 references
branch-and-bound
0 references
lower bound
0 references
D. C. decomposition
0 references
quadratic programming
0 references
numerical examples
0 references
Cholesky factorization
0 references
algorithm
0 references
0 references
0 references
