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 ...
Vol. 10, No. 1, Special Issue: Proceedings of the Workshop on Functional Analysis, 2004 (January 2006), pp. 13-29 (17 pages) Published By: Mathematical Society of the Republic of China Assume that F ...
Covers asymptotic evaluation of integrals (stationary phase and steepest descent), perturbation methods (regular and singular methods, and inner and outer expansions), multiple scale methods, and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback