Some results on non-expansive mappings and relaxed cocoercive mappings in Hilbert spaces
From MaRDI portal
Publication:3634306
DOI10.1080/00036810802308841zbMath1204.47084OpenAlexW2051562251WikidataQ58140663 ScholiaQ58140663MaRDI QIDQ3634306
Kang, Shin Min, Xiaolong Qin, Yeol Je Cho
Publication date: 24 June 2009
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00036810802308841
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)
Related Items
Some weak convergence theorems for a family of asymptotically nonexpansive nonself mappings, Iterative methods for generalized equilibrium problems and fixed point problems with applications, Convergence theorems based on hybrid methods for generalized equilibrium problems and fixed point problems
Cites Work
- Generalized system for relaxed cocoercive variational inequalities and projection methods
- General convergence analysis for two-step projection methods and applications to variational problems
- Viscosity approximation methods for nonexpansive mappings and monotone mappings
- On the convergence of Han's method for convex programming with quadratic objective
- An iterative approach to quadratic optimization
- Weak convergence theorems for nonexpansive mappings and monotone mappings
- Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
