MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS

Authors:	Zeng LuchuanDeptof Math Shanghai Normal Univ Shanghai China

Institution:	(1) Dept. of Math., Shanghai Normal Univ., 200234 Shanghai, China

Abstract:	In order to find roots of maximal monotone operators, this paper introduces and studies the modified approximate proximal point algorithm with an error sequence {e ^k} such that $\left\\| { e^k } \right\\| \leqslant \eta _k \left\\| { x^k - \tilde x^k } \right\\|$ with $\sum\limits_{k = 0}^\infty {\left( {\eta _k - 1} \right)} < + \infty$ and $\mathop {\inf }\limits_{k \geqslant 0} \eta _k = \mu \geqslant 1$ . Here, the restrictions on {η _k} are very different from the ones on {η _k}, given by He et al (Science in China Ser. A, 2002, 32 (11): 1026–1032.) that $\mathop {\sup }\limits_{k \geqslant 0} \eta _k = v < 1$ . Moreover, the characteristic conditions of the convergence of the modified approximate proximal point algorithm are presented by virtue of the new technique very different from the ones given by He et al. Supported both by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Educational Institutions of MOE, China, and by the Dawn Program Fund in Shanghai.

Keywords:	modified approximate proximal point algorithm maximal monotone operator convergence
本文献已被 CNKI SpringerLink 等数据库收录！