scholarly journals The Split Feasibility Problem with Some Projection Methods in Banach Spaces

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Toshiharu Kawasaki ◽  
Hiroko Manaka
Keyword(s):  
Banach Spaces ◽  
Metric Projection ◽  
Split Feasibility Problem ◽  
Projection Methods ◽  
Feasibility Problem ◽  
Equivalent Equation ◽  
The Split Feasibility Problem ◽  
Sunny Generalized Nonexpansive Retraction ◽  
Split Feasibility ◽  
Mathematical Programing

In this paper, we study the split feasibility problem in Banach spaces. At first, we prove that a solution of this problem is a solution of the equivalent equation defined by using a metric projection, a generalized projection, and sunny generalized nonexpansive retraction, respectively. Then, using the hybrid method with these projections, we prove strong convergence theorems in mathematical programing in order to find a solution of the split feasibility problem in Banach spaces.

An iterative algorithm with inertial technique for solving the split common null point problem in Banach spaces

2021 ◽  
pp. 2250120
Author(s):  
Yan Tang ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Banach Spaces ◽  
Split Feasibility Problem ◽  
Null Point ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Point Problem ◽  
Inertial Algorithm ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility

In this work, we introduce a modified inertial algorithm for solving the split common null point problem without the prior knowledge of the operator norms in Banach spaces. The strong convergence theorem of our method is proved under suitable assumptions. We apply our result to the split feasibility problem, split equilibrium problem and split minimization problem. Finally, we provide some numerical experiments including compressed sensing to illustrate the performances of the proposed method. The result presented in this paper improves and generalizes many recent important results in the literature.

scholarly journals Modified Halfspace-Relaxation Projection Methods for Solving the Split Feasibility Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-17
Author(s):  
Min Li
Keyword(s):  
Lower Bounds ◽  
Split Feasibility Problem ◽  
Step Length ◽  
Projection Methods ◽  
Numerical Results ◽  
Feasibility Problem ◽  
New Methods ◽  
Hrp Method ◽  
The Split Feasibility Problem ◽  
Split Feasibility

This paper presents modified halfspace-relaxation projection (HRP) methods for solving the split feasibility problem (SFP). Incorporating with the techniques of identifying the optimal step length with positive lower bounds, the new methods improve the efficiencies of the HRP method (Qu and Xiu (2008)). Some numerical results are reported to verify the computational preference.

A halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces

Filomat ◽  
2018 ◽  
Vol 32 (9) ◽  
pp. 3211-3227 ◽  
Author(s):  
Prasit Cholamjiak ◽  
Pongsakorn Sunthrayuth
Keyword(s):  
Fixed Point ◽  
Banach Spaces ◽  
Iterative Scheme ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Strong Convergence Theorem ◽  
Nonexpansive Semigroup ◽  
Relatively Nonexpansive ◽  
The Split Feasibility Problem ◽  
Split Feasibility

We study the split feasibility problem (SFP) involving the fixed point problems (FPP) in the framework of p-uniformly convex and uniformly smooth Banach spaces. We propose a Halpern-type iterative scheme for solving the solution of SFP and FPP of Bregman relatively nonexpansive semigroup. Then we prove its strong convergence theorem of the sequences generated by our iterative scheme under implemented conditions. We finally provide some numerical examples and demonstrate the efficiency of the proposed algorithm. The obtained result of this paper complements many recent results in this direction.

Sign in / Sign up

Export Citation Format

Share Document