Two modifications of the method of the multiplicative parameters in descent gradient methods
作者：
Highlights：
•
摘要
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.
论文关键词：Gradient descent methods,Newton method,Backtracking line search
论文评审过程：Available online 8 March 2012.
论文官网地址：https://doi.org/10.1016/j.amc.2012.02.029
