Iterative algorithms for solving the split feasibility problem in Hilbert spaces
From MaRDI portal
Recommendations
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- A new iterative algorithm for the multiple-sets split feasibility problem and the split equality fixed point problem
- Iterative algorithm for the split equality problem in Hilbert spaces
- New algorithms for the split variational inclusion problems and application to split feasibility problems
- scientific article; zbMATH DE number 7247621
Cites work
- scientific article; zbMATH DE number 3853749 (Why is no real title available?)
- scientific article; zbMATH DE number 4124452 (Why is no real title available?)
- scientific article; zbMATH DE number 6301548 (Why is no real title available?)
- scientific article; zbMATH DE number 3200865 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A note on the multiple-set split convex feasibility problem in Hilbert space
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- 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
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- General alternative regularization methods for nonexpansive mappings in Hilbert spaces
- Iterative methods for the split common fixed point problem in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On descent-projection method for solving the split feasibility problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving the split feasibility problem without prior knowledge of matrix norms
- Solving the variational inequality problem defined on intersection of finite level sets
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The multiple-sets split feasibility problem and its applications for inverse problems
- The split common null point problem
- Variational inequalities
- Viscosity approximation methods for fixed-points problems
Cited in
(33)- Iterative algorithm for solving the multiple-sets split equality problem with split self-adaptive step size in Hilbert spaces
- A new inertial self-adaptive algorithm for split common fixed-point problems
- Strong convergence theorem of two-step iterative algorithm for split feasibility problems
- Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
- A regularization algorithm for a splitting feasibility problem in Hilbert spaces
- A new iterative method with alternated inertia for the split feasibility problem
- A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces
- Iterative algorithm for the split equality problem in Hilbert spaces
- Two inertial subgradient extragradient algorithms for variational inequalities with fixed-point constraints
- Two inertial-type algorithms for solving the split feasibility problem
- Fixed point algorithms for split feasibility problems
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings
- Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
- Several accelerated iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators
- Splitting methods for a convex feasibility problem in Hilbert spaces
- A modified Halpern's iterative scheme for solving split feasibility problems
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- scientific article; zbMATH DE number 7475069 (Why is no real title available?)
- Convergence of an Inertial Shadow Douglas-Rachford Splitting Algorithm for Monotone Inclusions
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- An algorithm for the split-feasibility problems with application to the split-equality problem
- A cyclic iterative method for solving the system of split equality zero-point problems
- The strong convergence of Douglas-Rachford methods for the split feasibility problem
- Two strongly convergent CQ algorithms for split feasibility problem
- Two strong convergence theorems for iterative methods for solving the split feasibility problem with multiple output-sets in Hilbert spaces
- Iterative algorithms with Armijo-like search for solving split equality problems
- Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators
- Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models
- A modified iterative algorithm for solving split equality problems
- Modified inertial algorithms for a class of split feasibility problems and fixed point problems in Hilbert spaces
- An alternated inertial general splitting method with linearization for the split feasibility problem
This page was built for publication: Iterative algorithms for solving the split feasibility problem in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742522)
