A note on the hybrid steepest descent methods
Functional Analysis
2020-12-29 v1 Optimization and Control
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.
Cite
@article{arxiv.1101.0881,
title = {A note on the hybrid steepest descent methods},
author = {Koji Aoyama and Yasunori Kimura},
journal= {arXiv preprint arXiv:1101.0881},
year = {2020}
}