On the contraction-proximal point algorithms with multi-parameters |
| |
Authors: | Fenghui Wang Huanhuan Cui |
| |
Institution: | 1. Department of Mathematics, Luoyang Normal University, Luoyang, 471022, Henan, China
|
| |
Abstract: | In this paper we consider the contraction-proximal point algorithm: ${x_{n+1}=\alpha_nu+\lambda_nx_n+\gamma_nJ_{\beta_n}x_n,}$ where ${J_{\beta_n}}$ denotes the resolvent of a monotone operator A. Under the assumption that lim n ??? n ?=?0, ?? n ??? n ?=???, lim inf n ??? n ?>?0, and lim inf n ?? n ?> 0, we prove the strong convergence of the iterates as well as its inexact version. As a result we improve and recover some recent results by Boikanyo and Morosanu. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|