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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40566/ http://psasir.upm.edu.my/id/eprint/40566/1/48.%20Diagonal%20Preconditioned%20Conjugate%20Gradient%20Algorithm%20for.pdf |