Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators

Optimization ◽  
2021 ◽  
pp. 1-22
Author(s):  
Xiaojun Ma ◽  
Hongwei Liu
2018 ◽  
Vol 14 (4) ◽  
pp. 1595-1615 ◽  
Author(s):  
Suthep Suantai ◽  
◽  
Nattawut Pholasa ◽  
Prasit Cholamjiak ◽  

2019 ◽  
Vol 15 (2) ◽  
pp. 963-984
Author(s):  
Aviv Gibali ◽  
◽  
Dang Thi Mai ◽  
Nguyen The Vinh ◽  
◽  
...  

2013 ◽  
Vol 17 (5) ◽  
pp. 1839-1853 ◽  
Author(s):  
Yeong-Cheng Liou ◽  
Li-Jun Zhu ◽  
Yonghong Yao ◽  
Chiuh-Cheng Chyu

2017 ◽  
Vol 33 (1) ◽  
pp. 09-26
Author(s):  
QAMRUL HASAN ANSARI ◽  
◽  
AISHA REHAN ◽  
◽  

Inspired by the recent work of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, Set-Valued Var. Anal., 23 (2015), 205–221], in this paper, we study generalized split feasibility problems (GSFPs) in the setting of Banach spaces. We propose iterative algorithms to compute the approximate solutions of such problems. The weak convergence of the sequence generated by the proposed algorithms is studied. As applications, we derive some algorithms and convergence results for some problems from nonlinear analysis, namely, split feasibility problems, equilibrium problems, etc. Our results generalize several known results in the literature including the results of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, SetValued Var. Anal., 23 (2015), 205–221].


Sign in / Sign up

Export Citation Format

Share Document