A New Simple Conjugate Gradient Coefficient for Unconstrained Optimization
Conjugate gradient (CG) methods are important in solving unconstrained optimization especially for large-scale unconstrained optimization. In this paper, we proposed a new simple CG coefficient. The global convergence result is established by using exact line search. Numerical results based on numbe...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
HIKARI Ltd.
2015
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/6235/1/FH02-FIK-15-03339.pdf http://eprints.unisza.edu.my/6235/2/FH02-FIK-15-03432.jpg http://eprints.unisza.edu.my/6235/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Sultan Zainal Abidin |
| Language: | English English |
| Summary: | Conjugate gradient (CG) methods are important in solving unconstrained optimization especially for large-scale unconstrained optimization. In this paper, we proposed a new simple CG coefficient. The global convergence result is established by using exact line search. Numerical results based on number of iterations and CPU time. Numerical result shows that our method is efficient when compared to the other CG coefficients for a given standard test problems. |
|---|