General algorithms for split common fixed point problem of demicontractive mappings
DOI10.1080/02331934.2015.1053883zbMath1337.47087OpenAlexW1436393439MaRDI QIDQ2790889
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2015.1053883
split common fixed point problemssplit variational inequality problemdemicontractive mappingsplit equality fixed point problems
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Cites Work
- Unnamed Item
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Weak- and strong-convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces
- Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Weak and strong convergence theorems for nonspreading-type mappings in Hilbert spaces
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- A strongly convergent method for the split feasibility problem
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- On the Mann iteration process in a Hilbert space
- A multiprojection algorithm using Bregman projections in a product space
- General split feasibility problems in Hilbert spaces
- A general iterative method for nonexpansive mappings in Hilbert spaces
- On the Mann-type iteration and the convex feasibility problem
- Construction of fixed points of nonlinear mappings in Hilbert space
- Solving the split equality problem without prior knowledge of operator norms
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- A simple projection method for solving the multiple-sets split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
- Projection methods for the linear split feasibility problems
- The split common fixed-point problem for demicontractive mappings
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: General algorithms for split common fixed point problem of demicontractive mappings