A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value of this matrix is not greater than the number of variables of the problem. Then, using this double parameter scaled quasi Newton formula, an explicit formula for calculating the step length in the steepest descent method is presented and therefore, this method does not require the use of approximate methods for calculating step length. The numerical results obtained from the implementation of the algorithm in MATLAB software environment are presented for some optimization problems. These results show the efficiency of the proposed method in comparison with other existing methods.
Keywords:
Language:
English
Published:
New research in Mathematics, Volume:6 Issue: 26, 2020
Pages:
159 to 166
https://www.magiran.com/p2213433