ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
20/05/2014
20/05/2014
01/01/1994
|
| Resumo |
We propose a method for accelerating iterative algorithms for solving symmetric linear complementarity problems. The method consists in performing a one-dimensional optimization in the direction generated by a splitting method even for non-descent directions. We give strong convergence proofs and present numerical experiments that justify using this acceleration. |
| Formato |
35-44 |
| Identificador |
http://dx.doi.org/10.1080/00207169408804240 International Journal of Computer Mathematics. Reading: Gordon Breach Sci Publ Ltd, v. 50, n. 1-2, p. 35-44, 1994. 0020-7160 http://hdl.handle.net/11449/35499 10.1080/00207169408804240 WOS:A1994PG27800004 |
| Idioma(s) |
eng |
| Publicador |
Gordon Breach Sci Publ Ltd |
| Relação |
International Journal of Computer Mathematics |
| Direitos |
closedAccess |
| Palavras-Chave | #ITERATIVE ALGORITHMS #ACCELERATION #SYMMETRICAL LINEAR COMPLEMENTARITY PROBLEMS |
| Tipo |
info:eu-repo/semantics/article |
