Relaxed two points projection method for solving the multiple-sets split equality problem

DOI10.1007/s11075-017-0375-0zbMath1391.49064MaRDI QIDQ1751068

Yan Gao, Jian Yao, Ya-Zheng Dang

Publication date: 23 May 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0375-0

zbMATH Keywords

convergence; Hilbert space; multiple-sets split equality problem; relaxed two points projection method

Mathematics Subject Classification ID

49M37: Numerical methods based on nonlinear programming

65J10: Numerical solutions to equations with linear operators

65K15: Numerical methods for variational inequalities and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A relaxed alternating CQ-algorithm for convex feasibility problems
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces