zbMATH — the first resource for mathematics

Self-adaptive projection methods for the multiple-sets split feasibility problem. (English) Zbl 1215.65115
The authors present a self-adaptive projection method by adopting Armijo-like searches to solve the multiple-sets split feasibility problem. Then a relaxed self-adaptive projection method is proposed to solve a special case of the multiple-sets split feasibility problem by using projections onto half-spaces instead of those onto the original convex sets. Both methods avoid the estimation of the Lipschitz constant and the computation of the largest eigenvalue of the matrix. Convergence results for both methods are established. Some numerical results are reported to verify the theoretical assertions.

65K05 Numerical mathematical programming methods
90C29 Multi-objective and goal programming
90C30 Nonlinear programming
Full Text: DOI