A New Hybrid Algorithm for Convex Nonlinear Unconstrained Optimization
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 rep...
Saved in:
Main Authors: | Eman T. Hamed, Huda I. Ahmed, Abbas Y. Al-Bayati |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2019/8728196 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
New Investigation for the Liu-Story Scaled Conjugate Gradient Method for Nonlinear Optimization
by: Eman T. Hamed, et al.
Published: (2020-01-01) -
HWOA-TTA: A New Hybrid Metaheuristic Algorithm for Global Optimization and Engineering Design Applications
by: Huda Y. Najm, et al.
Published: (2024-01-01) -
Optimal Algorithms and the BFGS Updating Techniques for Solving Unconstrained Nonlinear Minimization Problems
by: Chein-Shan Liu
Published: (2014-01-01) -
A Modified Hybrid Conjugate Gradient Method for Unconstrained Optimization
by: Minglei Fang, et al.
Published: (2021-01-01) -
The Hybrid BFGS-CG Method in Solving Unconstrained Optimization Problems
by: Mohd Asrul Hery Ibrahim, et al.
Published: (2014-01-01)