arXiv · 1101.0881
A note on the hybrid steepest descent methods
Abstract
The aim of this paper is to prove that, in an appropriate setting, every iterative sequence generated by the hybrid steepest descent method is convergent whenever so is every iterative sequence generated by the Halpern type iterative method.
Explore related subjects
Keep this discovery
Koji Aoyama, Yasunori Kimura. 2011-01-05. A note on the hybrid steepest descent methods. https://arxiv.org/abs/1101.0881
Cite the original work for its findings. Save a collection to share your selection of sources.