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: | Ng, Choong Boon, Leong, Wah June, Monsi, Mansor |
---|---|
Format: | Article |
Language: | English |
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!
|
Similar Items
-
A class of diagonally preconditioned limited memory BFGS method for large scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009) -
A new diagonal gradient-type method for large scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013) -
A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016) -
Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2013) -
A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)