A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization

A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization

Hamed, Eman T.;Ahmed, Huda I.;Al-Bayati, Abbas Y.;Hamed, Eman T.;Ahmed, Huda I.;Al-Bayati, Abbas Y.;
journal of applied mathematics 2019 Vol. 2019
306
t2019ajournal

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.

Citation

ID: 10707
Ref Key: t2019ajournal
Use this key to autocite in SciMatic or Thesis Manager

References

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
10707
Unique Identifier:
10.1155/2019/8728196
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet

Saymatik Web3.0 Wallet