Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- 2 January 2005
- journal article
- Published by Taylor & Francis Ltd in Numerical Functional Analysis and Optimization
- Vol. 25 (7-8), 619-655
- https://doi.org/10.1081/nfa-200045815
Abstract
No abstract availableThis publication has 41 references indexed in Scilit:
- Image Restoration Subject to a Total Variation ConstraintIEEE Transactions on Image Processing, 2004
- A block-iterative surrogate constraint splitting method for quadratic signal recoveryIEEE Transactions on Signal Processing, 2003
- An efficient robust adaptive filtering algorithm based on parallel subgradient projection techniquesIEEE Transactions on Signal Processing, 2002
- Quadratic optimization of fixed points of nonexpansive mappings in hubert spaceNumerical Functional Analysis and Optimization, 1998
- Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappingsNumerical Functional Analysis and Optimization, 1998
- Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projectionsIEEE Transactions on Image Processing, 1997
- Approximation of fixed points of nonexpansive mappingsArchiv der Mathematik, 1992
- Iteration methods for convexly constrained ill-posed problems in hilbert spaceNumerical Functional Analysis and Optimization, 1992
- Generalized Image Restoration by the Method of Alternating Orthogonal ProjectionsIEEE Transactions on Circuits and Systems, 1978
- Quelques propriétés des opérateurs angle-bornés etn-cycliquement monotonesIsrael Journal of Mathematics, 1977