An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> (Q3358532)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4209916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> |
scientific article; zbMATH DE number 4209916 |
Statements
An equivalence between two algorithms for a class of quadratic programming problems with<i>m</i>matrices<sup>*</sup> (English)
0 references
1990
0 references
M-matrices
0 references
Newton projection method
0 references
Chandrasekaran method
0 references
0.8144429922103882
0 references
0.7770763635635376
0 references
