scholarly journals Non-Convex Split Feasibility Problems: Models, Algorithms and Theory

2020 ◽  
Vol 1 ◽  
pp. 1-15
Author(s):  
Aviv Gibali ◽  
Shoham Sabach ◽  
Sergey Voldman
Keyword(s):  
Split Feasibility Problems ◽  
Split Feasibility

scholarly journals ALGORITHMIC AND ANALYTICAL APPROACHES TO THE SPLIT FEASIBILITY PROBLEMS AND FIXED POINT PROBLEMS

2013 ◽  
Vol 17 (5) ◽  
pp. 1839-1853 ◽  
Author(s):  
Yeong-Cheng Liou ◽  
Li-Jun Zhu ◽  
Yonghong Yao ◽  
Chiuh-Cheng Chyu
Keyword(s):  
Fixed Point ◽  
Fixed Point Problems ◽  
Split Feasibility Problems ◽  
Analytical Approaches ◽  
Split Feasibility

scholarly journals Iterative methods for generalized split feasibility problems in Banach spaces

2017 ◽  
Vol 33 (1) ◽  
pp. 09-26
Author(s):  
QAMRUL HASAN ANSARI ◽  
◽  
AISHA REHAN ◽  
◽  
Keyword(s):  
Weak Convergence ◽  
Banach Spaces ◽  
Iterative Methods ◽  
Hilbert Spaces ◽  
Equilibrium Problems ◽  
Iterative Algorithms ◽  
Approximate Solutions ◽  
Split Feasibility Problems ◽  
Convergence Results ◽  
Split Feasibility

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].

scholarly journals S-Subgradient Projection Methods with S-Subdifferential Functions for Nonconvex Split Feasibility Problems

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1517
Author(s):  
Jinzuo Chen ◽  
Mihai Postolache ◽  
Yonghong Yao
Keyword(s):  
Weak Convergence ◽  
Projection Method ◽  
Split Feasibility Problem ◽  
Projection Methods ◽  
Feasibility Problem ◽  
Split Feasibility Problems ◽  
Finite Dimensional ◽  
Subgradient Projection ◽  
Weak Convergence Theorem ◽  
Split Feasibility

In this paper, the original C Q algorithm, the relaxed C Q algorithm, the gradient projection method ( G P M ) algorithm, and the subgradient projection method ( S P M ) algorithm for the convex split feasibility problem are reviewed, and a renewed S P M algorithm with S-subdifferential functions to solve nonconvex split feasibility problems in finite dimensional spaces is suggested. The weak convergence theorem is established.

Sign in / Sign up

Export Citation Format

Share Document