Two new classes of conjugate gradient method based on logistic mapping
Dublin Core
Title
Two new classes of conjugate gradient method based on logistic mapping
Subject
Conjugate gradient method
Descent condition
Global convergence condition
Logistic mapping
Unconstrained optimization
Descent condition
Global convergence condition
Logistic mapping
Unconstrained optimization
Description
Following the standard methods proposed by Polak-Ribiere-Polyak (P-R), in this work we introduce two new non-linear conjugate gradient methods for solving unconstraint optimization problem, our new methods based on P-R. Standard method (P-R) have performance well in numerical result but does not satisfy global convergency condition. In this paper we modified double attractive and powerful parameters that have better performance and good numerical result than P-R method, also each of our robust method can satisfies the descent condition and global convergency condition by using wolf condition. More over the second method modified by logistic mapping form, the main novelty is their numerical results and demonstrate performance well with compare to a standard method.
Creator
Banaz Hamza Jahwar1, Alaa Luqman Ibrahim2, Sherzad Muhammad Ajeel1, Salah Gazi Shareef2
Source
Journal homepage: http://telkomnika.uad.ac.id
Date
Aug 14, 2023
Contributor
peri irawan
Format
pdf
Language
english
Type
text
Files
Collection
Citation
Banaz Hamza Jahwar1, Alaa Luqman Ibrahim2, Sherzad Muhammad Ajeel1, Salah Gazi Shareef2, “Two new classes of conjugate gradient method based on logistic mapping,” Repository Horizon University Indonesia, accessed January 12, 2026, https://repository.horizon.ac.id/items/show/9852.