This is a preview. Log in through your library . Abstract In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization ...
Mathematics of Operations Research, Vol. 12, No. 4 (Nov., 1987), pp. 678-699 (22 pages) We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback