Mann's type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasi-nonexpansive mappings
DOI10.1186/1687-1812-2013-349zbMATH Open1319.49011OpenAlexW2170601877WikidataQ59295054 ScholiaQ59295054MaRDI QIDQ402502FDOQ402502
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
Recommendations
- The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems
- Mann-Halpern approximation methods for split variational inclusion and fixed point problems of nonexpansive mapping
- Split feasibility and fixed-point problems for asymptotically quasi-nonexpansive mappings
- Mann type hybrid extragradient method for variational inequalities, variational inclusions and fixed point problems
- Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
- Mann type algorithms for the fixed points of Lipschitzian strongly Lipschitz operators
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Split feasibility problems for total quasi-asymptotically nonexpansive mappings
- scientific article; zbMATH DE number 6155627
- On the Mann-type iteration and the convex feasibility problem
split feasibility problemsfixed-point problemsmaximal monotone mappingsasymptotically quasi-nonexpansive mappingsextragradient methods
Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40)
Cites Work
- A multiprojection algorithm using Bregman projections in a product space
- 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
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- Title not available (Why is that?)
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.
- General iterative algorithms approach to variational inequalities and minimum-norm fixed point for minimization and split feasibility problems
- Title not available (Why is that?)
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- On the Maximality of Sums of Nonlinear Monotone Operators
- Several solution methods for the split feasibility problem
- An extragradient method for solving split feasibility and fixed point problems
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- A modified Halpern's iterative scheme for solving split feasibility problems
- Split feasibility problems for total quasi-asymptotically nonexpansive mappings
Cited In (4)
This page was built for publication: Mann's type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasi-nonexpansive mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402502)
