In this paper, we first introduce a self-adaptive projection algorithm by adopting Armijolike searches to solve the spit equality problem (SEP), then we propose a relaxed self-adaptive projection algorithm by… Click to show full abstract
In this paper, we first introduce a self-adaptive projection algorithm by adopting Armijolike 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.
               
Click one of the above tabs to view related content.