In this paper, we study the split equality feasibility problem and present two algorithms for solving the problem with special structure. We prove the weak convergence of these algorithms under mild conditions. Especially, the selection of stepsize is only dependent on the information of current iterative points, but independent from the prior knowledge of operator norms. These algorithms provide new ideas for solving the split equality feasibility problem. Numerical results demonstrate the feasibility and effectiveness of these algorithms.
We study a kind of split equality fixed point problem which is an extension of split equality problem. We propose a kind of simultaneous iterative algorithm with a way of selecting the step length which does not need any a priori information about the operator norms and prove that the sequences generated by the iterative method converge weakly to the solution of this problem. Some numerical results are shown to confirm the feasibility and efficiency of the proposed methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.