Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
From MaRDI portal
(Redirected from Publication:343529)
Recommendations
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
- Strongly convergent iterative methods for generalized split feasibility problems in Hilbert spaces
- Approximation of common solutions to proximal split feasibility problems and fixed point problems in Hilbert spaces
- scientific article; zbMATH DE number 7598016
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new \(CQ\) method for solving split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- A relaxed alternating CQ-algorithm for convex feasibility problems
- A relaxed projection method for variational inequalities
- A simple projection method for solving the multiple-sets split feasibility problem
- A strongly convergent method for the split feasibility problem
- A sufficient and necessary condition for Halpern-type strong convergence to fixed points of nonexpansive mappings
- 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
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- An extragradient method for solving split feasibility and fixed point problems
- Applied iterative methods.
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
- Geometric properties of Banach spaces and nonlinear iterations
- Implicit and explicit algorithms for solving the split feasibility problem
- Improved relaxed CQ methods for solving the split feasibility problem
- Iterative Algorithms for Nonlinear Operators
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
- Strong convergence of a self-adaptive method for the split feasibility problem
- Strong convergence of approximated iterations for asymptotically pseudocontractive mappings
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- Strongly convergent iterative algorithms for solving a class of variational inequalities
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- The relaxed inexact projection methods for the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(23)- Comparison Theorems for Iterative Methods Based on Strong Splittings
- Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
- A new iterative method for the split feasibility problem
- Iterative methods for solving proximal split minimization problems
- A regularization algorithm for a splitting feasibility problem in Hilbert spaces
- Iterative methods of weak and strong convergence theorems for the split common solution of the feasibility problems, generalized equilibrium problems, and fixed point problems
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Iterative algorithm for the split equality problem in Hilbert spaces
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Splitting methods for a convex feasibility problem in Hilbert spaces
- A modified Halpern's iterative scheme for solving split feasibility problems
- Strong convergence theorems for relaxed split feasibility problems with related results in Hilbert spaces
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- A cyclic iterative method for solving the system of split equality zero-point problems
- A strongly convergent method for the split feasibility problem
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Two strong convergence theorems for iterative methods for solving the split feasibility problem with multiple output-sets in Hilbert spaces
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- Approximation of common solutions to proximal split feasibility problems and fixed point problems in Hilbert spaces
- Strongly convergent iterative methods for generalized split feasibility problems in Hilbert spaces
This page was built for publication: Iterative methods of strong convergence theorems for 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 Q343529)
