scholarly journals An Inertial Iterative Algorithm with Strong Convergence for Solving Modified Split Feasibility Problem in Banach Spaces

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huijuan Jia ◽  
Shufen Liu ◽  
Yazheng Dang
Keyword(s):  
Strong Convergence ◽  
Banach Spaces ◽  
Maximal Monotone ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Mild Assumption ◽  
Inertial Technique ◽  
Split Feasibility

In this paper, we propose an iterative scheme for a special split feasibility problem with the maximal monotone operator and fixed-point problem in Banach spaces. The algorithm implements Halpern’s iteration with an inertial technique for the problem. Under some mild assumption of the monotonicity of the related mapping, we establish the strong convergence of the sequence generated by the algorithm which does not require the spectral radius of A T A. Finally, the numerical example is presented to demonstrate the efficiency of the algorithm.

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.

Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces

2021 ◽  
pp. 2250106
Author(s):  
A. A. Mebawondu ◽  
L. O. Jolaoso ◽  
H. A. Abass ◽  
O. K. Narain
Keyword(s):  
Hilbert Spaces ◽  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Split Feasibility Problem ◽  
Monotone Operators ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Inertial Method ◽  
Split Feasibility

In this paper, we propose a new modified relaxed inertial regularization method for finding a common solution of a generalized split feasibility problem, the zeros of sum of maximal monotone operators, and fixed point problem of two nonlinear mappings in real Hilbert spaces. We prove that the proposed method converges strongly to a minimum-norm solution of the aforementioned problems without using the conventional two cases approach. In addition, we apply our convergence results to the classical variational inequality and equilibrium problems, and present some numerical experiments to show the efficiency and applicability of the proposed method in comparison with other existing methods in the literature. The results obtained in this paper extend, generalize and improve several results in this direction.

scholarly journals A Unified Iterative Treatment for Solutions of Problems of Split Feasibility and Equilibrium in Hilbert Spaces

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Young-Ye Huang ◽  
Chung-Chien Hong
Keyword(s):  
Maximal Monotone ◽  
Maximal Monotone Operators ◽  
Zero Point ◽  
Split Feasibility Problem ◽  
Monotone Operators ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Special Cases ◽  
Split Feasibility

We at first raise the so called split feasibility fixed point problem which covers the problems of split feasibility, convex feasibility, and equilibrium as special cases and then give two types of algorithms for finding solutions of this problem and establish the corresponding strong convergence theorems for the sequences generated by our algorithms. As a consequence, we apply them to study the split feasibility problem, the zero point problem of maximal monotone operators, and the equilibrium problem and to show that the unique minimum norm solutions of these problems can be obtained through our algorithms. Since the variational inequalities, convex differentiable optimization, and Nash equilibria in noncooperative games can be formulated as equilibrium problems, each type of our algorithms can be considered as a generalized methodology for solving the aforementioned problems.

scholarly journals An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huijuan Jia ◽  
Shufen Liu ◽  
Yazheng Dang
Keyword(s):  
Strong Convergence ◽  
Numerical Experiments ◽  
Convex Sets ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Matrix Inverse ◽  
The Split Feasibility Problem ◽  
Inertial Technique ◽  
Split Feasibility ◽  
Self Adaptive

The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require calculating matrix inverse. To accelerate the convergence, the algorithm adopts self-adaptive rules and incorporates inertial technique. The strong convergence is shown under some suitable conditions. In addition, some newly derived results are presented for solving the split feasibility problem and split feasibility problem with multiple output sets. Finally, numerical experiments illustrate that the algorithm converges more quickly than some existing algorithms. Our results extend and improve some methods in the literature.

scholarly journals Multiple-sets split feasibility problem and split equality fixed point problem for firmly quasi-nonexpansive or nonexpansive mappings

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Tongxin Xu ◽  
Luoyi Shi
Keyword(s):  
Fixed Point ◽  
Hilbert Spaces ◽  
Nonexpansive Mappings ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Projection Operators ◽  
Nonexpansive Operators ◽  
Split Feasibility

AbstractIn this paper, we propose a new iterative algorithm for solving the multiple-sets split feasibility problem (MSSFP for short) and the split equality fixed point problem (SEFPP for short) with firmly quasi-nonexpansive operators or nonexpansive operators in real Hilbert spaces. Under mild conditions, we prove strong convergence theorems for the algorithm by using the projection method and the properties of projection operators. The result improves and extends the corresponding ones announced by some others in the earlier and recent literature.

scholarly journals Weak and Strong Convergence Theorems for the Multiple-Set Split Equality Common Fixed-Point Problems of Demicontractive Mappings

2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
Yaqin Wang ◽  
Tae-Hwa Kim ◽  
Xiaoli Fang
Keyword(s):  
Fixed Point ◽  
Strong Convergence ◽  
Common Fixed Point ◽  
Iterative Algorithms ◽  
Split Feasibility Problem ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Weak And Strong Convergence ◽  
Demicontractive Mappings

We consider mixed parallel and cyclic iterative algorithms in this paper to solve the multiple-set split equality common fixed-point problem which is a generalization of the split equality problem and the split feasibility problem for the demicontractive mappings without prior knowledge of operator norms in real Hilbert spaces. Some weak and strong convergence results are established. The results obtained in this paper generalize and improve the recent ones announced by many others.

Sign in / Sign up

Export Citation Format

Share Document