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
The plain Newton-min algorithm for solving the linear complementarity problem (LCP) “0⩽x⊥(Mx+q)⩾0” can be viewed as an instance of the plain semismooth Newton method on the equational version “min(x,Mx+q)=0” of the problem. This algorithm converges for any q when M is an M-matrix, but not when it is...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2019
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/e96a6ead91534eb1801297a47f42427e |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sea el primero en dejar un comentario!