scholarly journals Strong Convergence Theorems for Maximal Monotone Operators with Nonspreading Mappings in a Hilbert Space

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Hongjie Liu ◽  
Junqing Wang ◽  
Qiansheng Feng

We prove the strong convergence theorems for finding a common element of the set of fixed points of a nonspreading mappingTand the solution sets of zero of a maximal monotone mapping and anα-inverse strongly monotone mapping in a Hilbert space. Manaka and Takahashi (2011) proved weak convergence theorems for maximal monotone operators with nonspreading mappings in a Hilbert space; there we introduced new iterative algorithms and got some strong convergence theorems for maximal monotone operators with nonspreading mappings in a Hilbert space.

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Huan-chun Wu ◽  
Cao-zong Cheng ◽  
De-ning Qu

We present a new iterative method for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions to an equilibrium problem, and the set of zeros of the sum of maximal monotone operators and prove the strong convergence theorems in the Hilbert spaces. We also apply our results to variational inequality and optimization problems.


2021 ◽  
Vol 31 (2) ◽  
pp. 117-124

One of the major problems in the theory of maximal monotone operators is to find a point in the solution set Zer( ), set of zeros of maximal monotone mapping . The problem of finding a zero of a maximal monotone in real Hilbert space has been investigated by many researchers. Rockafellar considered the proximal point algorithm and proved the weak convergence of this algorithm with the maximal monotone operator. Güler gave an example showing that Rockafellar’s proximal point algorithm does not converge strongly in an infinite-dimensional Hilbert space. In this paper, we consider an explicit method that is strong convergence in an infinite-dimensional Hilbert space and a simple variant of the hybrid steepest-descent method, introduced by Yamada. The strong convergence of this method is proved under some mild conditions. Finally, we give an application for the optimization problem and present some numerical experiments to illustrate the effectiveness of the proposed algorithm.


Sign in / Sign up

Export Citation Format

Share Document