TY - JOUR
T1 - Monotonic Iterative Algorithms for a Quasicomplementarity Problem
AU - Zhou , Shu-Zi
AU - Zan , Wu-Ping
AU - Zeng , Jin-Ping
JO - Journal of Computational Mathematics
VL - 3
SP - 293
EP - 298
PY - 2001
DA - 2001/06
SN - 19
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8981.html
KW - Quasicomplementarity problem, Iterative algorithm, Monotonic convergence, Schwarz algorithm.
AB - <p style="text-align: justify;">We present two iterative algorithms, so called SCP and SA respectively, for solving quasicomplementarity problem (QCP). Algorithm SCP is to approximate QCP by a sequence of ordinary complementarity problems (CP). SA is a Schwarz algorithm which can be implemented parallelly. We prove the algorithms above are monotonically convergent. &nbsp;</p>