Empirical improvement of elementary gradient methods
Matematičeskoe modelirovanie, Tome 17 (2005) no. 6, pp. 43-57
Cet article a éte moissonné depuis la source Math-Net.Ru
Very simple modified algorithms of quickest descent and minimal discrepancies are offered. These methods allow essentially increasing the convergence speed. The method is universal and does not require adjustment on a spectrum of a matrix. The efficiency of offered methods is confirmed by numerous computing experiments.
@article{MM_2005_17_6_a4,
author = {E. A. Alshina and A. A. Boltnev and O. A. Kacher},
title = {Empirical improvement of elementary gradient methods},
journal = {Matemati\v{c}eskoe modelirovanie},
pages = {43--57},
year = {2005},
volume = {17},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MM_2005_17_6_a4/}
}
E. A. Alshina; A. A. Boltnev; O. A. Kacher. Empirical improvement of elementary gradient methods. Matematičeskoe modelirovanie, Tome 17 (2005) no. 6, pp. 43-57. http://geodesic.mathdoc.fr/item/MM_2005_17_6_a4/