The problem of split convex feasibility and its alternating approximation algorithms

DOI10.1007/s10114-015-4602-0zbMath1338.47091OpenAlexW2244381233MaRDI QIDQ272506

Jitao Sun, Zhen Hua He

Publication date: 20 April 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-015-4602-0

zbMATH Keywords

alternating algorithmproblem of split convex feasibilitystrong convergent theorem

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37)

Related Items

Adapting step size algorithms for solving split equilibrium problems with applications to signal recovery ⋮ A simultaneous iteration algorithm for solving extended split equality fixed point problem ⋮ Approximating solution of split equality and equilibrium problems by viscosity approximation algorithms

Cites Work

• Unnamed Item
• Moudafi's open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems
• A multiprojection algorithm using Bregman projections in a product space
• A relaxed alternating CQ-algorithm for convex feasibility problems
• On split common fixed point problems
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem