Citation
Za’aba, Fatin Nadhirah and Marjugi, Siti Mahani
(2021)
Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems.
Discovering Mathematics, 43 (2).
101 - 110.
ISSN 2231-7023
Abstract
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 method with inexact line search, Strong Wolfe-Powell conditions. The global convergence and sufficient descent properties are established by using an inexact line search. The numerical result demonstrates that the modified method with inexact line search is superior and more efficient when compared to other CG methods.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://myjms.mohe.gov.my/index.php/dismath/articl...
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science |
| Publisher: | Malaysian Mathematical Science Society |
| Keywords: | Conjugate gradient; Unconstrained optimization; Inexact line search; Strong Wolfe-Powell |
| Depositing User: | Ms. Nuraida Ibrahim |
| Date Deposited: | 11 Jan 2023 09:06 |
| Last Modified: | 11 Jan 2023 09:06 |
| URI: | http://psasir.upm.edu.my/id/eprint/96474 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |