Approximation of Fixed Points for Enriched Suzuki Nonexpansive Operators with an Application in Hilbert Spaces

In this article, we introduce the class of enriched Suzuki nonexpansive (ESN) mappings. We show that this new class of mappings properly contains the class of Suzuki nonexpansive as well as the class of enriched nonexpansive mappings. We establish existence of fixed point and convergence of fixed point in a Hilbert space setting under the Krasnoselskii iteration process. One of the our main results is applied to solve a split feasibility problem (SFP) in this new setting of mappings. Our main results are a significant improvement of the corresponding results of the literature.

The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem

The multiple-sets split feasibility problem is the generalization of split feasibility problem, which has been widely used in fuzzy image reconstruction and sparse signal processing systems. In this paper, we present an inertial relaxed algorithm to solve the multiple-sets split feasibility problem by using an alternating inertial step. The advantage of this algorithm is that the choice of stepsize is determined by Armijo-type line search, which avoids calculating the norms of operators. The weak convergence of the sequence obtained by our algorithm is proved under mild conditions. In addition, the numerical experiments are given to verify the convergence and validity of the algorithm.

Inertial accelerated algorithms for solving split feasibility with multiple output sets in Hilbert spaces

In this paper, we propose two inertial accelerated algorithms which do not require prior knowledge of operator norm for solving split feasibility problem with multiple output sets in real Hilbert spaces. We prove weak and strong convergence results for approximating the solution of the considered problem under certain mild conditions. We also give some numerical examples to demonstrate the performance and efficiency of our proposed algorithms over some existing related algorithms in the literature.

Iterative approximation of split feasibility problem in real Hilbert spaces

In this paper, we propose an iterative algorithm for finding solution of split feasibility problem involving a λ−strictly pseudo-nonspreading map and asymptotically nonexpansive semigroups in two real Hilbert spaces. We prove weak and strong convergence theorems using the sequence obtained from the proposed algorithm. Finally, we applied our result to solve a monotone inclusion problem and present a numerical example to support our result.

WEAK AND STRONG CONVERGENCE THEOREMS OF ALGORITHMIC SCHEMES FOR THE MULTIPLE-SETS SPLIT FEASIBILITY PROBLEM

Trong bài báo này, để giải bài toán chấp nhận tách đa tập (MSSFP) trong không gian Hilbert, chúng tôi trình bày một cách tiếp cận tổng quát để xây dựng các phương pháp lặp. Chúng tôi đề xuất một lược đồ thuật toán xâu trung bình với sự hội tụ yếu và một lược đồ thuật toán xâu trung bình với sự hội tụ mạnh. Lược đồ thuật toán xâu trung bình với sự hội tụ mạnh được xây dựng dựa trên phương pháp lặp tổng quát cho ánh xạ không giãn, trong đó cỡ bước được tính toán trực tiếp trong mỗi bước lặp mà không cần sử dụng chuẩn của toán tử. Những lược đồ thuật toán này không chỉ bao hàm những cải tiến của phương pháp lặp vòng và lặp đồng thời đã biết như những trường hợp riêng mà còn bao hàm cả những phương pháp lặp mới

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

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.