New conjugate gradient methods for solving large-scale unconstrained optimization problems
Conjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient (Bk ) are proposed in order to solve unconstrained optimiz...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Terengganu: Universiti Malaysia Terengganu
2014
|
| Subjects: | |
| Online Access: | http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3033 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Conjugate gradient methods hold an important role in unconstrained optimizations. Numerous recent studies and modifications have been aimed to improve these methods. In this research, four modifications of the conjugate gradient coefficient
(Bk ) are proposed in order to solve unconstrained optimization problems using exact line searches. |
|---|