![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
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.
C.R Categories:
Research of this author was partially supported by CNPq grants No. 301699/81 and No. 201487192.6 and NIH grant No. HL28438. Part of this research was completed while the first author was visiting the Medical Image Processing Group, Department of Radiology, University of Pennsylvania, Philadelphia, Pennsylvania.
Research of this author was partially supported by CNPq grants No. 301699/81 and No. 201487192.6 and NIH grant No. HL28438. Part of this research was completed while the first author was visiting the Medical Image Processing Group, Department of Radiology, University of Pennsylvania, Philadelphia, Pennsylvania.
Notes
Research of this author was partially supported by CNPq grants No. 301699/81 and No. 201487192.6 and NIH grant No. HL28438. Part of this research was completed while the first author was visiting the Medical Image Processing Group, Department of Radiology, University of Pennsylvania, Philadelphia, Pennsylvania.