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

Volume: 6, Issue: 4, Pages: 63 - 63
Published: Apr 23, 2018
Abstract
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...
Paper Details
Title
A New Descent Algorithm Using the Three-Step Discretization Method for Solving Unconstrained Optimization Problems
Published Date
Apr 23, 2018
Volume
6
Issue
4
Pages
63 - 63
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.