This paper is about a variable Krasnosel’skij–Mann algorithm

${x}_{n+1}=(1-{\alpha}_{n}){x}_{n}+{\alpha}_{n}{T}_{n}{x}_{n}$ in Banach spaces and its weak convergence to a fixed point of the mapping

$T$. Here,

$\left\{{\alpha}_{n}\right\}$ is a sequence in

$[0,1]$ and

$\left\{{T}_{n}\right\}$ is a sequence of nonexpansive mappings such that

${T}_{n}x$ converges to

$Tx$ for every

$x$. Furthermore, the author applies his result to solve the split feasibility problem, i.e., finding a point

$x$ such that

$x\in C$ and

$Ax\in Q$, where

$C$ and

$Q$ are closed convex convex subsets of Hilbert spaces. The algorithm is also generalized for solving multiple-set split feasibility problems. It would have been helpful if some examples had been used to illustrate the process.