A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems

84 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (2005, methodology): “We compare here the adaptive projected subgradient methods (K = = 256) for n in Example 3 and Example 4 respectively, where n = 0 5, n = n n− 1 n− 9 , and projection onto S n = H− hn is utilized as in (15) of Yamada et al. (2002a) for C 1 and r = 1.”
Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings (2005, methodology): “In Yamada et al. (2002a), Yamada (2003), Yamada and Ogura (2003a,b, 2004a,c), the subgradient projection was used to elude from the load for solving large scale systems of equations in an adaptive signal processing problem.”
Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators (2013, methodology): “The method and its extensions [24, 25, 33] inspired many researcher to active studies on related algorithms (see, e.”