A strongly convergent method for the split feasibility problem
From MaRDI portal
Publication:695990
DOI10.1155/2012/125046zbMath1253.65103OpenAlexW2068621677WikidataQ58694862 ScholiaQ58694862MaRDI QIDQ695990
Yeong-Cheng Liou, Yonghong Yao, Naseer Shahzad
Publication date: 18 December 2012
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/125046
Numerical mathematical programming methods (65K05) Inverse problems in optimal control (49N45) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items
Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Preconditioning methods for solving a general split feasibility problem ⋮ Coincidence point theorems on metric spaces via simulation functions ⋮ A strong convergence algorithm for the two-operator split common fixed point problem in Hilbert spaces ⋮ 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 ⋮ Algorithmic approach to the split problems ⋮ General algorithms for split common fixed point problem of demicontractive mappings ⋮ A unified iterative treatment for solutions of problems of split feasibility and equilibrium in Hilbert spaces ⋮ Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces
Cites Work
- Unnamed Item
- Regularized methods for the split feasibility problem
- Applications of fixed-point and optimization methods to the multiple-set 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
- Perturbed projections and subgradient projections for the multiple-sets 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
- Weak convergence theorems for nonexpansive mappings and monotone mappings
- Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
- 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
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- Iterative Algorithms for Nonlinear Operators
- 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
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- 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 the Maximality of Sums of Nonlinear Monotone Operators
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- An Iteration Formula for Fredholm Integral Equations of the First Kind
This page was built for publication: A strongly convergent method for the split feasibility problem
