Mann's type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasi-nonexpansive mappings
From MaRDI portal
Publication:402502
DOI10.1186/1687-1812-2013-349zbMath1319.49011OpenAlexW2170601877WikidataQ59295054 ScholiaQ59295054MaRDI QIDQ402502
Publication date: 28 August 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-349
asymptotically quasi-nonexpansive mappingsextragradient methodssplit feasibility problemsfixed-point problemsmaximal monotone mappings
Variational inequalities (49J40) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Unnamed Item, Unnamed Item, PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS, New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
Cites Work
- Unnamed Item
- Unnamed Item
- General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems
- Split feasibility problems for total quasi-asymptotically nonexpansive mappings
- An extragradient method for solving split feasibility and fixed point problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- A multiprojection algorithm using Bregman projections in a product space
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- A modified Halpern's iterative scheme for solving split feasibility problems
- 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 unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- The relaxed CQ algorithm solving the split feasibility problem
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- On the Maximality of Sums of Nonlinear Monotone Operators
- Several solution methods for the split feasibility problem
