Iterative algorithms for solving the split feasibility problem in Hilbert spaces

DOI10.1007/s11784-017-0480-7zbMath1491.47075OpenAlexW2792436858MaRDI QIDQ1742522

Jing Zhao, Haili Zong

Publication date: 11 April 2018

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

Full work available at URL: https://doi.org/10.1007/s11784-017-0480-7

zbMATH Keywords

iterative algorithmstrong convergenceweak convergencesplit feasibility problemreal Hilbert space

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items (13)

Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators ⋮ Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings ⋮ A simple look at the method for solving split feasibility problems in Hilbert spaces ⋮ A new iterative method with alternated inertia for the split feasibility problem ⋮ An alternated inertial general splitting method with linearization for the split feasibility problem ⋮ Two inertial-type algorithms for solving the split feasibility problem ⋮ Unnamed Item ⋮ Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization ⋮ Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints ⋮ Unnamed Item ⋮ Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General alternative regularization methods for nonexpansive mappings in Hilbert spaces
• Solving the variational inequality problem defined on intersection of finite level sets
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• On descent-projection method for solving the split feasibility problems
• Viscosity approximation methods for fixed-points problems
• Iterative methods for the split common fixed point problem in Hilbert spaces
• Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• 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 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
• The Split Common Null Point Problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Signal Recovery by Proximal Forward-Backward Splitting
• Variational inequalities
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: Iterative algorithms for solving the split feasibility problem in Hilbert spaces