A theoretical and numerical comparison of some semismooth algorithms for complementarity problems (Q1583587)
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 1522100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A theoretical and numerical comparison of some semismooth algorithms for complementarity problems |
scientific article; zbMATH DE number 1522100 |
Statements
A theoretical and numerical comparison of some semismooth algorithms for complementarity problems (English)
0 references
19 July 2001
0 references
nonlinear complementarity problem
0 references
semismoothness
0 references
Newton's method
0 references
projected gradient method
0 references
large scale problem
0 references
0.8666900992393494
0 references
0.8666747212409973
0 references
0.8184168934822083
0 references
0.812138020992279
0 references
0.8105811476707458
0 references
