Alhawarat, Ahmad and Masmali, Sultanah and Moghrabi, Issam A. R. and Ahmad, Norazura and M. Sulaiman, Ibrahim and Ismail, Shahrina (2025) A Descent Conjugate Gradient Method for Large Scale Unconstrained Optimization Problems with Application. International Journal of Neutrosophic Science, 26 (2). pp. 258-278. ISSN 26926148
|
PDF
- Published Version
Restricted to Registered users only Download (1MB) | Request a copy |
Abstract
n recent years, there has been a surge of attention to the Conjugate Gradient Method (CGM) and its applications. This is because the algorithm of CGM does not require the computation of the second derivative or an approximation during the iteration process. In this study, a four-term descent CGM is proposed by utilizing the famous Polak–Ribiere–Polyak (PRP) conjugate gradient formula. The direction of the proposed method achieves the descent property without line search consideration. In addition, the convergence properties are met to generate the stationary points. Findings from numerical experiments on unconstrained optimization and robotic motion control problems demonstrate that the novel approach outperforms some existing methods including the famous CG-Descent conjugate gradient method.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Inexact line search , Conjugate gradient method , Descent condition , CG-Descent , Numerical comparison |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | School of Quantitative Sciences |
| Depositing User: | Mr. Izhar Hj. Hashim |
| Date Deposited: | 18 Nov 2026 07:22 |
| Last Modified: | 18 Nov 2026 07:22 |
| URI: | https://repo.uum.edu.my/id/eprint/32881 |
Actions (login required)
![]() |
View Item |
