Contraction behaviour of iteration–discretization based on gradient type projections
DOI10.1080/02331934.2014.938073zbMath1310.65076OpenAlexW2007936556MaRDI QIDQ4981842
Fadhel A. Al-Musallam, Andrzej Cegielski, Christian Grossmann
Publication date: 20 March 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.938073
variational inequalitiesfixed point setsquasi-nonexpansive mappingsiteration-discretizationtruncated contractions
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Iteration-discretization methods for variational inequalities over fixed point sets
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Iterative methods for fixed point problems in Hilbert spaces
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Convergence of hybrid steepest-descent methods for variational inequalities
- Iterative selection methods for common fixed point problems
- Convergence of inexact iterative schemes for nonexpansive set-valued mappings
- Regularization and iterative methods for monotone variational inequalities
- The cascadic multigrid method for elliptic problems
- An iterative approach to quadratic optimization
- A cascadic multigrid algorithm for variational inequalities
- On the fast and fully discretized solution of integral and pseudo-differential equations on smooth curves
- Numerical treatment of partial differential equations. Revised translation of the 3rd German edition of `Numerische Behandlung partieller Differentialgleichungen' by Martin Stynes.
- A Regularized Hybrid Steepest Descent Method for Variational Inclusions
- Iterative Algorithms for Nonlinear Operators
- Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: Contraction behaviour of iteration–discretization based on gradient type projections