ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

Depierro, A. R.; Lopes, J. M.

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/35499

Title:

ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

Author(s):

Institution:

Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual Paulista (UNESP)

ISSN:

0020-7160

Abstract:

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.

Issue Date:

1-Jan-1994

Citation:

International Journal of Computer Mathematics. Reading: Gordon Breach Sci Publ Ltd, v. 50, n. 1-2, p. 35-44, 1994.

Time Duration:

35-44

Publisher:

Gordon Breach Sci Publ Ltd

Keywords:

ITERATIVE ALGORITHMS
ACCELERATION
SYMMETRICAL LINEAR COMPLEMENTARITY PROBLEMS

Source:

http://dx.doi.org/10.1080/00207169408804240

URI:

Access Rights:

Acesso restrito

Type:

outro

Source:

http://repositorio.unesp.br/handle/11449/35499

Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Show full item record View Statistics