A strongly convergent method for the split feasibility problem
From MaRDI portal
Summary: We introduce and analyze a strongly convergent method which combined regularized method, with extragradient method for solving the split feasibility problem in the setting of infinite-dimensional Hilbert spaces. Note that the strong convergence point is the minimum norm solution of the split feasibility problem.
Recommendations
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Regularized methods for the split feasibility problem
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- An extragradient method for solving split feasibility and fixed point problems
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
Cites work
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- A modified extragradient method for the split feasibility and fixed point problems
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the 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
- An extragradient method for solving split feasibility and fixed point problems
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Implicit and explicit algorithms for solving the split feasibility problem
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- 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
- On the Maximality of Sums of Nonlinear Monotone Operators
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Regularized methods for the split feasibility problem
- Several solution methods for the split feasibility problem
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed inexact projection methods for the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Weak convergence theorems for nonexpansive mappings and monotone mappings
Cited in
(21)- A strong convergence algorithm for the two-operator split common fixed point problem in Hilbert spaces
- Algorithmic approach to the split problems
- A strong convergence algorithm for a fixed point constrained split null point problem
- Strong convergence on the split feasibility problem by mixing W-mapping
- Application of new strongly convergent iterative methods to split equality problems
- Affine algorithms for the split variational inequality and equilibrium problems
- A general iterative algorithm for an infinite family of nonexpansive operators in Hilbert spaces
- Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces
- A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces
- Preconditioning methods for solving a general split feasibility problem
- Strongly convergent iterative methods for generalized split feasibility problems in Hilbert spaces
- General algorithms for split common fixed point problem of demicontractive mappings
- Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces
- Relaxed implicit extragradient-like methods for finding minimum-norm solutions of the split feasibility problem
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- Regularized methods for the split feasibility problem
- Coincidence point theorems on metric spaces via simulation functions
- scientific article; zbMATH DE number 7574093 (Why is no real title available?)
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- scientific article; zbMATH DE number 6285844 (Why is no real title available?)
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
This page was built for publication: A strongly convergent method for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695990)
