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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Elsevier
2019-12-01
|
| coleção: | EURO Journal on Computational Optimization |
| Assuntos: | |
| Acesso em linha: | http://www.sciencedirect.com/science/article/pii/S2192440621001210 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|