Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
The nonlinear conjugate gradient (CG) method is essential in solving large-scale unconstrained optimization problems due to its simplicity and low memory requirement. Numerous studies and improvements have been made recently to improve this strategy. Hence, this study will create a modified CG metho...
Main Authors: | Za’aba, Fatin Nadhirah, Marjugi, Siti Mahani |
---|---|
Format: | Article |
Published: |
Malaysian Mathematical Science Society
2021
|
Similar Items
-
A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022) -
A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
by: Ishak, M.A.I., et al.
Published: (2024) -
A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016) -
Line search methods in conjugate gradient algorithms : a study of nonlinear unconstrained optimization problems /
by: Babaeizadeh, Soudeh, et al.
Published: (2012) -
Nonlinear Conjugate Gradient Coefficients with Exact and Strong Wolfe Line Searches Techniques
by: Awad Abdelrahman, et al.
Published: (2022-01-01)