New algorithms for the split common null point problem

Abstract

Listen

Translate article

ABSTRACT Two new iterative algorithms are introduced for solving the split common null point problem (SCNPP). The first algorithm is shown to converge weakly and the second is shown to converge strongly to a solution of SCNPP in a Hilbert space. The algorithms are forward methods (i.e, involving no computation of the resolvent of a monotone operator). Another feature of the algorithms is that the selection of the step-sizes does not need prior knowledge of operator norms. Numerical experiments are presented to illustrate the performance of the algorithms.