mailto:uumlib@uum.edu.my 24x7 Service; AnyTime; AnyWhere

Two diagonal conjugate gradient-like methods for unconstrained optimization

Mohammad, Hassan and Sulaiman, Ibrahim Mohammed and Mamat, Mustafa (2024) Two diagonal conjugate gradient-like methods for unconstrained optimization. Journal of Industrial and Management Optimization, 20 (1). pp. 170-187. ISSN 15475816

[thumbnail of JIMO 20 01 2024 170-187.pdf]
Preview
PDF - Published Version
Available under License Attribution 4.0 International (CC BY 4.0).

Download (8MB) | Preview

Abstract

In this paper, we studied a two member family of diagonal conjugate gradient like methods for unconstrained minimization problems. The proposed search directions of the methods are obtained by incorporating a diagonal Hessian approximation approach with the modifications of the Polak–Ribière–Polyak and Liu-Storey parameters. The resulting directions guarantees the sufficient decrease of the objective function free from any line search. The global convergence of the proposed methods using both the Wolfe and Armijo-type line search conditions without the convexity assumption on the function is provided. Furthermore, the R-linear convergence rate of the methods are analyzed under Wolfe line search condition. Numerical experiments demonstrated the performance of the method on general unconstrained minimization problems and image restoration problem.

Item Type: Article
Uncontrolled Keywords: Unconstrained optimization, conjugate gradient methods, global convergence, numerical results
Subjects: Q Science > QA Mathematics
T Technology > T Technology (General)
Divisions: School of Quantitative Sciences
Depositing User: Mr. Izhar Hj. Hashim
Date Deposited: 11 Nov 2026 10:35
Last Modified: 11 Nov 2026 10:35
URI: https://repo.uum.edu.my/id/eprint/35182

Actions (login required)

View Item View Item