An improved method for solving multiple-sets split feasibility problem

DOI10.1186/1687-1812-2012-168zbMath1469.65105OpenAlexW2148393893WikidataQ59290919 ScholiaQ59290919MaRDI QIDQ385702

Yunfei Du, Ru Dong Chen

Publication date: 2 December 2013

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2012-168

zbMATH Keywords

convergencemultiple-sets split feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient simultaneous method for the constrained multiple-sets split feasibility problem
• Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
• A multiprojection algorithm using Bregman projections in a product space
• A new halfspace-relaxation projection method for the split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The relaxed CQ algorithm solving the split feasibility problem

This page was built for publication: An improved method for solving multiple-sets split feasibility problem