full
search.png

Search

close.png

Cancel

arrow
Volume 19, Issue 3
Monotonic Iterative Algorithms for a Quasicomplementarity Problem

Shu-Zi Zhou, Wu-Ping Zan & Jin-Ping Zeng

J. Comp. Math., 19 (2001), pp. 293-298.

Published online: 2001-06

Preview Full PDF 2669 24893

Cited by

google scholar semantic scholar
Export citation
  • 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.  

  • Keywords

Quasicomplementarity problem, Iterative algorithm, Monotonic convergence, Schwarz algorithm.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-19-293, author = {Zhou , Shu-ZiZan , 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 = {

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.  

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8981.html} }
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 -

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.  

Zhou , Shu-ZiZan , Wu-Ping and Zeng , Jin-Ping. (2001). Monotonic Iterative Algorithms for a Quasicomplementarity Problem. Journal of Computational Mathematics. 19 (3). 293-298. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard