Empirical improvement of elementary gradient methods

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.