Double projection algorithms for solving the split feasibility problems
From MaRDI portal
Publication:2315623
DOI10.3934/jimo.2018135zbMath1463.65137OpenAlexW2890379475WikidataQ128981966 ScholiaQ128981966MaRDI QIDQ2315623
Su Zhang, Jie Sun, Ya-Zheng Dang
Publication date: 25 July 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018135
optimizationconvergence analysissplit feasibility problemArmijo-type line searchdouble projection algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration ⋮ Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ General splitting methods with linearization for the split feasibility problem ⋮ An inertial iterative algorithm with strong convergence for solving modified split feasibility problem in Banach spaces ⋮ New inertial relaxed method for solving split feasibilities ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ An inertial triple-projection algorithm for solving the split feasibility problem
