Modified hybrid steepest-descent methods for variational inequalities and fixed points
DOI10.1016/j.mcm.2010.01.023zbMath1201.65115OpenAlexW1993849125MaRDI QIDQ611740
Publication date: 14 December 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.01.023
iterative algorithmvariational inequalitynonexpansive mappingcommon fixed pointequilibrium problemhybrid steepest-descent method
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Numerical solutions to equations with nonlinear operators (65J15) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence of hybrid steepest-descent methods for variational inequalities
- Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
- Variational methods in partially ordered spaces
- Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals
- An iterative method for finding common solutions of equilibrium and fixed point problems
- Iterative Algorithms for Nonlinear Operators
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- Mann-Type Steepest-Descent and Modified Hybrid Steepest-Descent Methods for Variational Inequalities in Banach Spaces
- Strong convergence to common fixed points of infinite nonexpansive mappings and applications