Diagonal preconditioned conjugate gradient algorithm for unconstrained optimization
The nonlinear conjugate gradient (CG) methods have widely been used in solving unconstrained optimization problems. They are well-suited for large-scale optimization problems due to their low memory requirements and least computational costs. In this paper, a new diagonal preconditioned conjugate gr...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Universiti Putra Malaysia Press
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40566/1/48.%20Diagonal%20Preconditioned%20Conjugate%20Gradient%20Algorithm%20for.pdf http://psasir.upm.edu.my/id/eprint/40566/ http://pertanika.upm.edu.my/Pertanika%20PAPERS/JST%20Vol.%2022%20(1)%20Jan.%202014/18%20Page%20213-224%20(JST%200385-2012).pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The nonlinear conjugate gradient (CG) methods have widely been used in solving unconstrained optimization problems. They are well-suited for large-scale optimization problems due to their low memory requirements and least computational costs. In this paper, a new diagonal preconditioned conjugate gradient (PRECG) algorithm is designed, and this is motivated by the fact that a pre-conditioner can greatly enhance the performance of the CG method. Under mild conditions, it is shown that the algorithm is globally convergent for strongly convex functions. Numerical results are presented to show that the new diagonal PRECG method works better than the standard CG method. |
|---|