MONOTONIC ITERATIVE ALGORITHMS FOR A QUASICOMPLEMENTARITY PROBLEM  

作　　者：Zhou, SZ Zan, WP Zeng, JP 

机构地区：[1]Hunan Univ, Dept Appl Math, Changsha 410082, Peoples R China

出　　处：《Journal of Computational Mathematics》2001年第3期293-298,共6页计算数学（英文）

摘　　要：Focuses on a study which presented monotonic iterative algorithms for solving quasicomplementarity problem (QCP). Details on the sequential complementarity problem (CP) algorithm; Information on the supersolution and subsolution of CP to QCP; Equation of Schwarz algorithm.Focuses on a study which presented monotonic iterative algorithms for solving quasicomplementarity problem (QCP). Details on the sequential complementarity problem (CP) algorithm; Information on the supersolution and subsolution of CP to QCP; Equation of Schwarz algorithm.

关 键 词：quasicomplementarity problem iterative algorithm monotonic convergence Schwarz algorithm 

分 类 号：O241[理学—计算数学]