An efficient hybrid conjugate gradient method for unconstrained optimization and image restoration problems
The conjugate gradient (CG) method is an optimization technique known for its rapid convergence; it has blossomed into significant developments and applications. Numerous variations of CG methods have emerged to en-hance computational efficiency and address real-world challenges. In this work, a nov...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ferdowsi University of Mashhad
2025-03-01
|
| Series: | Iranian Journal of Numerical Analysis and Optimization |
| Subjects: | |
| Online Access: | https://ijnao.um.ac.ir/article_45709_488077f4279cfd491a4cf6e1ba65597e.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The conjugate gradient (CG) method is an optimization technique known for its rapid convergence; it has blossomed into significant developments and applications. Numerous variations of CG methods have emerged to en-hance computational efficiency and address real-world challenges. In this work, a novel conjugate gradient method is introduced to solve nonlinear unconstrained optimization problems. Based on the combination of PRP (Polak–Ribière–Polyak), HRM (Hamoda–Rivaie–Mamat) and NMFR (new modified Fletcher–Reeves) algorithms, our method produces a descent di-rection without depending on any line search. Moreover, it enjoys global convergence under mild assumptions and is applied successfully on various standard test problems as well as image processing. The numerical results indicate that the proposed method outperforms several existing methods in terms of efficiency. |
|---|---|
| ISSN: | 2423-6977 2423-6969 |