Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators
From MaRDI portal
Publication:5264011
DOI10.1080/01630563.2015.1015079zbMath1319.47066OpenAlexW2062220262MaRDI QIDQ5264011
Publication date: 20 July 2015
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2015.1015079
strong convergenceHilbert spacefeasibility problemsplit common fixed-point problemviscosity iterative algorithmdirected operators
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (9)
Solving the multiple-set split equality common fixed-point problem of firmly quasi-nonexpansive operators ⋮ Unnamed Item ⋮ An accelerate algorithm for the split equality common fixed-point problem of directed operators ⋮ General alternative regularization methods for split equality common fixed-point problem ⋮ A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings ⋮ Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Unnamed Item ⋮ A self-adaptive iterative algorithm for the split common fixed point problems
Cites Work
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- Algorithms for the split variational inequality problem
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- Strong convergence of a self-adaptive method for the split feasibility problem
- Opial-Type Theorems and the Common Fixed Point Problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Variational Analysis
- 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 Projection Algorithms for Solving Convex Feasibility Problems
- 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
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators