A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368)
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: A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem |
scientific article; zbMATH DE number 7194686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem |
scientific article; zbMATH DE number 7194686 |
Statements
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (English)
0 references
29 April 2020
0 references
iterative complexity
0 references
linear complementarity problem
0 references
Fathi and Murty problems
0 references
globalization
0 references
Harker and Pang algorithm
0 references
line search
0 references
Newton-min algorithm
0 references
nondegenerate matrix
0 references
\textbf{P}-matrix
0 references
semismooth Newton method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
