.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
linear complementarity
proximal point algorithm
projection method
variational inequalities
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
A computational avenue towards understanding and design of zwitterionic anti-biofouling materials
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容