ACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS

dc.creatorDEPIERRO, AR
dc.creatorLOPES, JM
dc.date1994
dc.date2014-07-30T13:43:20Z
dc.date2015-11-26T17:45:51Z
dc.date2014-07-30T13:43:20Z
dc.date2015-11-26T17:45:51Z
dc.date.accessioned2018-03-29T00:28:16Z
dc.date.available2018-03-29T00:28:16Z
dc.identifierInternational Journal Of Computer Mathematics. Gordon Breach Sci Publ Ltd, v. 50, n. 41671, n. 35, n. 44, 1994.
dc.identifier0020-7160
dc.identifierWOS:A1994PG27800004
dc.identifier10.1080/00207169408804240
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/54051
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/54051
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1288309
dc.descriptionWe 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.description50
dc.description41671
dc.description35
dc.description44
dc.languageen
dc.publisherGordon Breach Sci Publ Ltd
dc.publisherReading
dc.publisherInglaterra
dc.relationInternational Journal Of Computer Mathematics
dc.relationInt. J. Comput. Math.
dc.rightsfechado
dc.sourceWeb of Science
dc.subjectITERATIVE ALGORITHMS
dc.subjectACCELERATION
dc.subjectSYMMETRICAL LINEAR COMPLEMENTARITY PROBLEMS
dc.subjectConvergence
dc.titleACCELERATING ITERATIVE ALGORITHMS FOR SYMMETRICAL LINEAR COMPLEMENTARITY-PROBLEMS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución