Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces

DOI10.1186/s13660-016-1228-4zbMath1349.90685OpenAlexW2555792297WikidataQ37529794 ScholiaQ37529794MaRDI QIDQ343529

Yu-Chao Tang, Li-Wei Liu

Publication date: 28 November 2016

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

Full work available at URL: https://doi.org/10.1186/s13660-016-1228-4

zbMATH Keywords

strong convergencesplit feasibility problemthe best approximation

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Iterative procedures involving nonlinear operators (47J25)

Related Items

Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
• Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
• Regularized methods for the split feasibility problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• The relaxed inexact projection methods for the split feasibility problem
• An extragradient method for solving split feasibility and fixed point problems
• Implicit and explicit algorithms for solving the split feasibility problem
• A strongly convergent method for the split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
• A relaxed alternating CQ-algorithm for convex feasibility problems
• Strong convergence of a self-adaptive method for the split feasibility problem
• Strong convergence of approximated iterations for asymptotically pseudocontractive mappings
• A new \(CQ\) method for solving split feasibility problem
• Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
• A new halfspace-relaxation projection method for the split feasibility problem
• Geometric properties of Banach spaces and nonlinear iterations
• Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
• A simple projection method for solving the multiple-sets split feasibility problem
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Iterative Algorithms for Nonlinear Operators
• Solving the split feasibility problem without prior knowledge of matrix norms
• 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 sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
• A relaxed projection method for variational inequalities
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem
• Convex analysis and monotone operator theory in Hilbert spaces