-
39浏览
-
0点赞
-
0收藏
-
0分享
-
52下载
-
0评论
-
引用
期刊论文
MONOTONIC ITERATIVE ALGORITHMS FOR A QUASICOMPLEMENTARITY PROBLEM*
Journal of Computational Mathematics, Vol.19, No.3, 2001, 293-298.,-0001,():
We present two iterative algorithms, so called SCP and SA respectively, for soling quasicomplementarity problem (QCP). Algorithm SCP is to approximate QCP by a se-quence of ordinary complementarity problems(CP). SA is a Schwarz algorithm which can be implemented parllelly. We prove the algorithms above are monotonically convergent.
【免责声明】以下全部内容由[曾金平]上传于[2005年07月06日 17时26分46秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果