In this work,a new method for solving inclusion problems in real Hilbert space is giv-en.The algorithm is inspired by forward-backward splitting method,contraction method,inertial meth-od and self-adaptive step sizes.The characteristic of the algorithm is that the inertial acceleration meth-od is used many times in the iteration,and the adaptive step size may increase with the increase of the number of iterations.Under the assumption that the solution set of the inclusion problem is non-empty,one map is maximally monotone,and the other map is monotone and Lipschitz continuous,the strong convergence of the algorithm is proved.
inclusion problemforward-backward splitting methodzero point
万方数据
维普
