Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces
From MaRDI portal
Publication:2829600
DOI10.1080/01630563.2016.1185614zbMath1351.49043OpenAlexW2345697857MaRDI QIDQ2829600
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
strong convergenceuniform convexitymetric projectioniterative approximationBregman projectionsplit feasibility problemsuniform smoothness
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ 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 ⋮ A generalized self-adaptive algorithm for the split feasibility problem in Banach spaces ⋮ Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems ⋮ An iterative method for split inclusion problems without prior knowledge of operator norms ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces ⋮ Gradient methods with selection technique for the multiple-sets split feasibility problem ⋮ Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces ⋮ A cyclic iterative method for solving Multiple Sets Split Feasibility Problems in Banach Spaces ⋮ A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex functions, monotone operators and differentiability.
- Further investigation into approximation of a common solution of fixed point problems and split feasibility problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- The viscosity approximation process for quasi-nonexpansive mappings in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- An iterative row-action method for interval convex programming
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Spectral operators
- Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Inequalities in Banach spaces with applications
- 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
- The relaxed CQ algorithm solving the split feasibility problem
- A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
- Generalized KM theorems and their applications
- A note on the CQ algorithm for the split feasibility problem
