@Article{JCM-19-3,
author = {Zhou, Shu-Zi and Zan, Wu-Ping and Zeng, Jin-Ping},
title = {Monotonic Iterative Algorithms for a Quasicomplementarity Problem},
journal = {Journal of Computational Mathematics},
year = {2001},
volume = {19},
number = {3},
pages = {293--298},
abstract = {<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>},
issn = {1991-7139},
doi = {https://doi.org/2001-JCM-8981},
url = {https://global-sci.com/article/85474/monotonic-iterative-algorithms-for-a-quasicomplementarity-problem}
}