A New Type of Step Sizes for Unconstrained Optimization

Step sizes is very important for a global convergence gradient method for solving the problems of unconstrained optimization. The new step sizes formulas techniques proposed, the key idea used in the construction of the algorithm is to approximate Hessian by a suitable diagonal matrix, which has been found to be the most efficient in this paper. Under weaker conditions, we define the convergences of the proposed methods. In addition, we will...