Search

The purpose of this paper is to propose an iterative algorithm for solving the split equality common null point problem (SECNP), which is to find an element of the set of common zero points for a finite family of maximal monotone operators in Hilbert spaces. We introduce the concept of bounded linear regularity for the SECNP and construct several sufficient conditions to ensure the linear convergence of the algorithm. Moreover, some numerical experiments are given to test the validity of our results. [ABSTRACT FROM AUTHOR]

The Opial property of Hilbert spaces is essential in many fixed point theorems of non-expansive maps. While the Opial property does not hold in every Banach space, the Bregman–Opial property does. This suggests to study fixed point theorems for various Bregman non-expansive like maps in the general Banach space setting. In this paper, after introducing the notion of Bregman generalized hybrid sequences in a reflexive Banach space, we prove (with using the Bregman–Opial property instead of the Opial property) convergence theorems for such sequences. We also provide new fixed point theorems for Bregman generalized hybrid maps defined on an arbitrary but not necessarily convex subset of a reflexive Banach space. We end this paper with a brief discussion of the existence of Bregman absolute fixed points of such maps. [ABSTRACT FROM AUTHOR]

The inverse problem is one of the four major problems in computational mathematics. There is an inverse problem in medical image reconstruction and radiotherapy that is called the multiple-sets split equality problem. The multiple-sets split equality problem is a unified form of the split feasibility problem, split equality problem, and split common fixed point problem. In this paper, we present two iterative algorithms for solving it. The suggested algorithms are based on the gradient method with a selection technique. Based on this technique, we only need to calculate one projection in each iteration. [ABSTRACT FROM AUTHOR]

In this paper, we propose the simultaneous sub-gradient projection algorithm with the dynamic step size (SSPA for short) for solving the multiple-sets split feasibility problem (MSSFP for short) and investigate its linear convergence. We involve a notion of bounded linear regularity for the MSSFP and construct several sufficient conditions to prove the linear convergence for the SSPA. In particular, the SSPA is an easily calculated algorithm that uses orthogonal projection onto half-spaces. Furthermore, some numerical results are provided to verify the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]