Year: 2001
Author: Shu-Zi Zhou, Wu-Ping Zan, Jin-Ping Zeng
Journal of Computational Mathematics, Vol. 19 (2001), Iss. 3 : pp. 293–298
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2001-JCM-8981
Journal of Computational Mathematics, Vol. 19 (2001), Iss. 3 : pp. 293–298
Published online: 2001-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6
Keywords: Quasicomplementarity problem Iterative algorithm Monotonic convergence Schwarz algorithm.