Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm (Q3773196)
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: Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm |
scientific article; zbMATH DE number 4032935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm |
scientific article; zbMATH DE number 4032935 |
Statements
Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm (English)
0 references
1987
0 references
least squares
0 references
linear complementarity problem
0 references
numerical study
0 references
computation time
0 references
Lemke's algorithm
0 references
0.7977379560470581
0 references
0.7964519262313843
0 references
0.7958961725234985
0 references
0.7911245226860046
0 references
