Depierro, A. R.Lopes, J. M.2014-05-202014-05-201994-01-01International Journal of Computer Mathematics. Reading: Gordon Breach Sci Publ Ltd, v. 50, n. 1-2, p. 35-44, 1994.0020-7160http://hdl.handle.net/11449/35499We 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.35-44engITERATIVE ALGORITHMSACCELERATIONSYMMETRICAL LINEAR COMPLEMENTARITY PROBLEMSArtigo10.1080/00207169408804240WOS:A1994PG27800004Acesso restrito