ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:25:01Z
dc.date.available2014-05-20T15:25:01Z
dc.date.created2014-05-20T15:25:01Z
dc.date.issued1994-01-01
dc.identifierInternational Journal of Computer Mathematics. Reading: Gordon Breach Sci Publ Ltd, v. 50, n. 1-2, p. 35-44, 1994.
dc.identifier0020-7160
dc.identifierhttp://hdl.handle.net/11449/35499
dc.identifier10.1080/00207169408804240
dc.identifierWOS:A1994PG27800004
dc.description.abstractWe 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.
dc.languageeng
dc.publisherGordon Breach Sci Publ Ltd
dc.relationInternational Journal of Computer Mathematics
dc.relation1.054
dc.relation0,456
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectITERATIVE ALGORITHMS
dc.subjectACCELERATION
dc.subjectSYMMETRICAL LINEAR COMPLEMENTARITY PROBLEMS
dc.titleACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución