.png){kind=icon}
Return
A rapid algorithm for a class of linear complementarity problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.11.184.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a new rapid projection method for solving a class of linear complementarity problems based on matrix split technique and the idea of proximal point algorithm. The global convergence of the method is analyzed. Numerical experiments show that the new method compared with some existing methods has more efficiency and robustness in solving kinds of linear complementarity problems and can be applied very easily. Numerical experiments also show that the new method for those problems is almost not sensitive to the parameters used in this method. (c) 2006 Published by Elsevier Inc.
Keywords:
linear complementarity
proximal point algorithm
projection method
variational inequalities
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveA computational avenue towards understanding and design of zwitterionic anti-biofouling materials
PREAI
ShareSaveShareSaveShareSave no more
no more