A New Descent Algorithm Using the Three-Step Discretization Method for Solving Unconstrained Optimization Problems

Mathematics

Mohammad-Mehdi Hosseini¹  Mina Torabi¹ 

[1] Department of Applied Mathematics, Faculty of Mathematics, Yazd University, P. O. Box 89195-741, Yazd, Iran;

关键词: unconstrained optimization;    line search;    three-step discretization method;    steepest descent method;   

DOI  :  10.3390/math6040063

来源: DOAJ

【 摘 要 】

In this paper, three-step Taylor expansion, which is equivalent to third-order Taylor expansion, is used as a mathematical base of the new descent method. At each iteration of this method, three steps are performed. Each step has a similar structure to the steepest descent method, except that the generalized search direction, step length, and next iterative point are applied. Compared with the steepest descent method, it is shown that the proposed algorithm has higher convergence speed and lower computational cost and storage.

【 授权许可】

Unknown