A Modified Nonlinear Conjugate Gradient Method for Unconstrained Optimization
Nonlinear conjugate gradient method holds an important role in solving large scale unconstrained optimization problems. Their simplicity, low memory requirement, and global convergence stimulated a massive study on the method. Numerous modifications have been done recently to improve its performance...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
HIKARI Ltd.
2015
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/6249/1/FH02-FIK-15-03341.pdf http://eprints.unisza.edu.my/6249/2/FH02-FIK-15-03434.jpg http://eprints.unisza.edu.my/6249/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Sultan Zainal Abidin |
| Language: | English English |
| Summary: | Nonlinear conjugate gradient method holds an important role in solving large scale unconstrained optimization problems. Their simplicity, low memory requirement, and global convergence stimulated a massive study on the method. Numerous modifications have been done recently to improve its performance. In this paper, we proposed a new formula for the conjugate gradient coefficient k that generates the descent search direction. In addition, we establish the global convergence result under exact line search. The outcome of our numerical experiment show that the proposed formula is very efficient and more reliable when compare to other conjugate gradient methods. |
|---|