In this paper, we first introduce a self-adaptive projection algorithm by adopting Armijo- like searches to solve the spit equality problem (SEP), then we propose a relaxed self-adaptive projection algorithm by using projections onto half-spaces instead of those onto the original convex sets, which is much more practical. Weak convergence results for both algorithms are analyzed.