Two modifications of the method of the multiplicative parameters in descent gradient methods

We introduce a new algorithm for the unconstrained optimization, based on introducing the random parameter θ ∈ (0, 1) in the standard iterative scheme for the descent gradient method. Thus, some recent results are improved.