Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces
DOI10.1080/02331934.2016.1187145zbMath1453.47014OpenAlexW2404442135MaRDI QIDQ2836077
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1187145
maximal monotone operatorequilibrium problemsplit feasibility problemfirmly nonexpansive mappingaveraged mapping
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Regularized methods for the split feasibility problem
- A proximal point algorithm converging strongly for general errors
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- Four parameter proximal point algorithms
- Inexact Halpern-type proximal point algorithm
- A strongly convergent method for the split feasibility problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of generalized proximal point algorithms
- Approximating solutions of maximal monotone operators in Hilbert spaces
- Viscosity approximation methods for nonexpansive mappings
- General split feasibility problems in Hilbert spaces
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- 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
- A limit theorem for projections
- Monotone Operators and the Proximal Point Algorithm
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
This page was built for publication: Algorithms for nonexpansive self-mappings with application to the constrained multiple-set split convex feasibility fixed point problem in Hilbert spaces
