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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback