A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
From MaRDI portal
Publication:4639131
DOI10.1080/02331934.2017.1396603OpenAlexW2768013100MaRDI QIDQ4639131
Mohammad Eslamian, Gholamreza Zamani Eskandani, Masoumeh Raeisi
Publication date: 3 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1396603
duality mappingBregman projectionmultiple-sets split feasibility problemmulti-valued Bregman relatively nonexpansive mappings
Related Items
A hybrid extragradient method for solving pseudomonotone equilibrium problems using Bregman distance ⋮ Gradient projection-type algorithms for solving ϕ-strongly pseudomonotone equilibrium problems in Banach spaces ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Solving a general split equality problem without prior knowledge of operator norms in Banach spaces ⋮ Modified Tseng's extragradient methods with self-adaptive step size for solving bilevel split variational inequality problems ⋮ Inertial proximal point algorithm for the split common solution problem of monotone operator equations ⋮ Split common fixed point problem for demimetric mappings and Bregman relatively nonexpansive mappings ⋮ A new self-adaptive method for the multiple-sets split common null point problem in Banach spaces ⋮ On the zero point problem of monotone operators in Hadamard spaces ⋮ Unnamed Item ⋮ An iterative explicit algorithm for solving equilibrium problems in Banach spaces ⋮ A hybrid extragradient method for a general split equality problem involving resolvents and pseudomonotone bifunctions in Banach spaces ⋮ An inertial iterative algorithm with strong convergence for solving modified split feasibility problem in Banach spaces ⋮ On the generalized Bregman projection operator in reflexive Banach spaces ⋮ Gradient methods with selection technique for the multiple-sets split feasibility problem ⋮ A strong convergence theorem for Bregman quasi-noexpansive mappings with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
- Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach 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
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- Bregman weak relatively nonexpansive mappings in Banach spaces
- Convergence theorem for common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Products of Finitely Many Resolvents of Maximal Monotone Mappings in Reflexive Banach Spaces
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- Inequalities in Banach spaces with applications
- Bregman Monotone Optimization Algorithms
- Iterative oblique projection onto convex sets and the split feasibility problem
- Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
- A New Algorithm for Solving The Multiple-Sets Split Feasibility Problem in Banach Spaces
- Convergence theorems on generalized equilibrium problems and fixed point problems with applications
