摘要
研究了隐互补问题的更一般形式,即广义隐互补问题.将逐点逼近法应用到广义隐互补问题中,研究了在伪单调的条件下算法的收敛性,并证明了算法具有R-线性收敛性.
Implicit Complementarity Problem（ICP） can be applied to many fields of natural science.This paper studies generalized implicit complementarity problem.The classic projection operator and fix-point theory is used to solve ICP.The proximal point algorithm is built about generalized implicit complementarity problem and proves its convergence with pseudomonotone function.
出处
《西安文理学院学报（自然科学版）》
2010年第4期26-28,共3页
Journal of Xi’an University(Natural Science Edition)
关键词
广义隐互补问题
逐点逼近法
算法收敛性.
Generalized Implicit Complementarity Problem
proximal point algorithm
linearly convergence
