The constrained multiple-sets split feasibility problem and its projection algorithms

DOI10.1186/1029-242X-2013-272zbMath1364.47046WikidataQ59301372 ScholiaQ59301372MaRDI QIDQ2637506

Yaqin Zheng, Yeong-Cheng Liou, Jinwei Shi

Publication date: 12 February 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

strong convergenceminimum norm solutionprojection algorithmsconstrained multiple-sets split feasibility problem

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with linear operators (65J10)

Cites Work

• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• Implicit and explicit algorithms for solving the split feasibility problem
• Perturbed projections and subgradient projections for the 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
• Composite projection algorithms for the split feasibility problem
• Iterative Algorithms for Nonlinear Operators
• 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 unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem

This page was built for publication: The constrained multiple-sets split feasibility problem and its projection algorithms