A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization

Clicks: 352
ID: 10707
2019
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #6 of 41 articles by views in journal of applied mathematics

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
In this study, we tend to propose a replacement hybrid algorithmic rule which mixes the search directions like Steepest Descent (SD) and Quasi-Newton (QN). First, we tend to develop a replacement search direction for combined conjugate gradient (CG) and QN strategies. Second, we tend to depict a replacement positive CG methodology that possesses the adequate descent property with sturdy Wolfe line search. We tend to conjointly prove a replacement theorem to make sure global convergence property is underneath some given conditions. Our numerical results show that the new algorithmic rule is powerful as compared to different standard high scale CG strategies.
Reference Key
t2019ajournal Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Hamed, Eman T.;Ahmed, Huda I.;Al-Bayati, Abbas Y.;Hamed, Eman T.;Ahmed, Huda I.;Al-Bayati, Abbas Y.;
Journal journal of applied mathematics
Year 2019
DOI
10.1155/2019/8728196
URL
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.