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...
Main Authors: | Eman T. Hamed, Huda I. Ahmed, Abbas Y. Al-Bayati |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2019-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2019/8728196 |
Similar Items
-
New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization
by: Abbas Al-Bayati, et al.
Published: (2009-09-01) -
A New Symmetric Rank One Algorithm for Unconstrained Optimization
by: Abbas Al-Bayati, et al.
Published: (2011-12-01) -
Enriched Algorithms for Large Scale Unconstrained Optimization
by: Abbas Al-Bayati, et al.
Published: (2007-07-01) -
Two Modified QN-Algorithms for Solving Unconstrained Optimization Problems
by: Abbas Al-Bayati, et al.
Published: (2013-09-01) -
Investigation on Scaled CG-Type Algorithms for Unconstrained Optimization
by: Abbas Al-Bayati, et al.
Published: (2007-12-01)