摘要
在Hilbert空间中给出求极大单调算子零点的近似邻近点算法,给出的误差准则比现有的算法弱,并证明该算法生成的序列{xk}弱收敛到算子的零点。应用该算法求解单调变分不等式,得到求解单调变分不等式的近似邻近点算法。
This paper presents a approximate proximal algorithm finding the zero of a maximal monotone operator in Hilbert space, whose error criterion is weaker than that in the literatures. It's proved that the sequence {x^k} generated by this algorithm converges weakly to the zero point of the maximal monotome operator. It's applied to solve the variational inequality problem involving a monotone operator, and a new approximate proximal algorithm is established.
出处
《广西师范大学学报(自然科学版)》
CAS
北大核心
2008年第2期37-40,共4页
Journal of Guangxi Normal University:Natural Science Edition
基金
国家自然科学基金资助项目(10761002)
广西科学基金资助项目(0832101)
关键词
极大单调算子
近似邻近点算法
变分不等式
maximal monotone operator
approximate proximal algorithm
variational inequality