| 摘要: |
| 在T-1(0)∩C≠∅的条件下,结合文献[5]的思想给出一个求解x∈T-1(0)∩C的近似邻近点算法,并证明新算法的收敛性.该算法的误差准则比较宽松. |
| 关键词: 极大单调算子 邻近点算法 收敛性 |
| DOI： |
| 投稿时间：2006-12-28 |
| 基金项目:广西民族大学青年科学基金项目资助 |
|
| An Approximate Proximal Point Algorithm for Maximal Monotone Operators |
|
TANG Guo-ji
|
| (Mathematics and Computer Science College, Guangxi University for Nationalities, Nanning, Guangxi, 530006, China) |
| Abstract: |
| Suppose T-1 (0)∩C≠∅.In this paper, we construct an approximate proximal point algorithm for solving x-∈T-1 (0)∩C based on the work of Solodov and Svaiter[5] and prove the convergence of the algorithm.The error criterion in this paper is less restrictive. |
| Key words: maximal monotone operators proximal point algorithm convergence |
