Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
Publication:4912752
DOI10.1080/01630563.2012.716807zbMath1272.47078OpenAlexW1975181084MaRDI QIDQ4912752
Rafał Zalas, Andrzej Cegielski
Publication date: 5 April 2013
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2012.716807
Hilbert spacevariational inequality problemconvergence theoremquasi-nonexpansive operatorgeneralized hybrid steepest descent method
Variational and other types of inequalities involving nonlinear operators (general) (47J20) 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) Numerical methods for variational inequalities and related problems (65K15)
Related Items (32)
Cites Work
- Unnamed Item
- Unnamed Item
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative selection methods for common fixed point problems
- Approximation of fixed points of nonexpansive mappings
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Some notes on Bauschke's condition
- Iterative Algorithms for Nonlinear Operators
- A general iterative scheme with applications to convex optimization and related fields
- Extension of the Hybrid Steepest Descent Method to a Class of Variational Inequalities and Fixed Point Problems with Nonself-Mappings
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex programming in Hilbert space
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators