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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback