A new hybrid conjugate gradient algorithm for unconstrained optimization with inexact line search
Abstract
Many researchers are interested for developed and improved the conjugate gradient method for solving large scale unconstrained optimization problems. In this work a new parameter will be presented as a convex combination between RMIL and MMWU. The suggestion method always produces a descent search direction at each iteration. Under strong wolfe powell (SWP) line search conditions, the global convergence of the proposed method is established. The preliminary numerical comparisons with some others CG methods have shown that this new method is efficient and robust in solving all given problems.
Keywords
Global convergence; Hybrid conjugate gradient method; Sufficient descent; SWP; Unconstrained optimization
Full Text:
PDFDOI: http://doi.org/10.11591/ijeecs.v20.i2.pp939-947
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).