Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
DOI10.1080/01630563.2016.1185614zbMATH Open1351.49043OpenAlexW2345697857MaRDI QIDQ2829600FDOQ2829600
Authors: Y. Shehu 
Publication date: 8 November 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2016.1185614
Recommendations
- Iterative methods for split feasibility problems in certain Banach spaces
- Strong convergence result of split feasibility problems in Banach spaces
- A cyclic iterative method for solving multiple sets split feasibility problems in Banach spaces
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- An iterative method for solving multiple-set split feasibility problems in Banach spaces
Bregman projectionstrong convergencesplit feasibility problemsmetric projectionuniform convexityuniform smoothnessiterative approximation
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Set-valued and variational analysis (49J53)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- An iterative row-action method for interval convex programming
- Nonlinear functional analysis. Fixed point theory and its applications
- Inequalities in Banach spaces with applications
- Convex functions, monotone operators and differentiability.
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- Generalized KM theorems and their applications
- A note on the CQ algorithm for the split feasibility problem
- Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces
- A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
- Spectral operators
- Further investigation into approximation of a common solution of fixed point problems and split feasibility problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces
- Title not available (Why is that?)
- A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Strong convergence theorem for split feasibility problems and variational inclusion problems in real Banach spaces
- A cyclic iterative method for solving Multiple Sets Split Feasibility Problems in Banach Spaces
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- An iterative method for split inclusion problems without prior knowledge of operator norms
- A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces
- Self-adaptive algorithms for solving split feasibility problem with multiple output sets
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
- Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems
This page was built for publication: Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829600)
