A Globally Convergence Spectral Conjugate Gradient Method for Solving Unconstrained Optimization Problems
In this paper, a modified spectral conjugate gradient method for solving unconstrained optimization problems is studied, which has sufficient descent direction and global convergence with an inexact line searches. The Fletcher-Reeves restarting criterion was employed to the standard and new versions...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2013-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163543_277d164a2ade385a41c49593e19891f3.pdf |
| Summary: | In this paper, a modified spectral conjugate gradient method for solving unconstrained optimization problems is studied, which has sufficient descent direction and global convergence with an inexact line searches. The Fletcher-Reeves restarting criterion was employed to the standard and new versions and gave dramatic savings in the computational time. The Numerical results show that the proposed method is effective by comparing it with the FR-method. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |