MONOTONIC ITERATIVE ALGORITHMS FOR A QUASICOMPLEMENTARITY PROBLEM

• 来源期刊: 计算数学(英文版)
• 学科: 数学
• 关键词: Quasicomplementarity problem Iterative algorithm Monotonic convergence Schwarz algorithm.
• 年，卷（期）: 2001,（3）
• 页码范围: 293-298
• 页数: 6页
• 分类号: O1
• 语种: 英文

摘要

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.