Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2304.06694 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909436884287488 |
|---|---|
| author | Alhawarat, Ahmad |
| author_facet | Alhawarat, Ahmad |
| contents | The conjugate gradient (CG) method is widely used for solving nonlinear unconstrained optimization problems because it requires less memory to implement. In this paper, we propose a new parameter of the Dai Liao conjugacy condition of the CG method with the restart property, which depends on the Lipschitz constant and is related to the Hestenes Stiefel method. The proposed method satisfies the descent condition and global convergence properties for convex and non-convex functions. In the numerical experiment, we compare the new method with CG_Descent using more than 200 functions from the CUTEst library. The comparison results show that the new method outperforms CG Descent in terms of CPU time, number of iterations, number of gradient evaluations, and number of function evaluations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_06694 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method Alhawarat, Ahmad Optimization and Control 49M37, 65K05, 90C30 The conjugate gradient (CG) method is widely used for solving nonlinear unconstrained optimization problems because it requires less memory to implement. In this paper, we propose a new parameter of the Dai Liao conjugacy condition of the CG method with the restart property, which depends on the Lipschitz constant and is related to the Hestenes Stiefel method. The proposed method satisfies the descent condition and global convergence properties for convex and non-convex functions. In the numerical experiment, we compare the new method with CG_Descent using more than 200 functions from the CUTEst library. The comparison results show that the new method outperforms CG Descent in terms of CPU time, number of iterations, number of gradient evaluations, and number of function evaluations. |
| title | Modified parameter of Dai Liao conjugacy condition of the conjugate gradient method |
| topic | Optimization and Control 49M37, 65K05, 90C30 |
| url | https://arxiv.org/abs/2304.06694 |