基于A-极大单调算子的3步近似点迭代算法  

A three-step hybrid proximal point algorithm based on the-maximal monotone framework

作　　者：陈汉军[1] 杨雪[1] 苏永福 

机构地区：[1]天津工业大学研究生部,天津300160

出　　处：《云南大学学报（自然科学版）》2008年第S1期258-260,共3页Journal of Yunnan University(Natural Sciences Edition)

摘　　要：介绍了用3步近似点迭代算法研究A-极大单调算子的不动点问题和用预解算子研究包含问题的解.同时给出了在某些条件下,三步迭代算法的收敛性.Three-step hybrid proximal point algorithm is suggested and analyzed for finding the common element of the set of fixed points of a A-maximal monotone mapping and the set of the solutions of the inclusion problem using the resolvent operator technique.The convergence criteria of the three-step iterative method is studied under some mild conditions.

关 键 词：非扩张映像 A-极大单调 包含问题 

分 类 号：O177.91[理学—数学]