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.1187145zbMATH Open1453.47014OpenAlexW2404442135MaRDI QIDQ2836077FDOQ2836077
Authors: Chung-Chien Hong 
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
Recommendations
- Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space
- Minimum-norm fixed point of nonexpansive mappings with applications
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
- Iterative algorithms for solving multiple split common fixed problems in Hilbert spaces
- Multiple-sets split feasibility problem and split equality fixed point problem for firmly quasi-nonexpansive or nonexpansive mappings
equilibrium problemmaximal monotone operatorsplit feasibility problemfirmly nonexpansive mappingaveraged mapping
Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- 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
- Iterative oblique projection onto convex sets and the split feasibility problem
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Approximating solutions of maximal monotone operators in Hilbert spaces
- Viscosity approximation methods for nonexpansive mappings
- Iterative Algorithms for Nonlinear Operators
- Regularized methods for the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- Convergence of generalized proximal point algorithms
- A limit theorem for projections
- A proximal point algorithm converging strongly for general errors
- Four parameter proximal point algorithms
- General split feasibility problems in Hilbert spaces
- A strongly convergent method for the split feasibility problem
- Inexact Halpern-type proximal point algorithm
- Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces
Cited In (2)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836077)
