A new type of conjugate gradient methods with sufficient descent property for unconstrained optimization

Simple item page
dc.contributor.authorAbashar, Abdelrhaman
dc.date.accessioned2016-11-19T03:31:48Z
dc.date.available2016-11-19T03:31:48Z
dc.date.issued2014-08
dc.description.abstractConjugate gradient methods (CG) have an important part in unconstrained optimizations. Numerous studies and modifications have been concerned to improve these methods. In this study, two modifications of the CG coefficient (Bk) are proposed in a way to solve unconstrained optimization problems using exact line searches and inexact line searches by employing strong Wolfe line search.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/4719
dc.language.isoenen_US
dc.publisherTerengganu: Universiti Malaysia Terengganuen_US
dc.subjectQA 218 .A2 2014en_US
dc.subjectAbashar, Abdelrhamanen_US
dc.subjectTesis PPIMG 2014en_US
dc.subjectConjugate gradient methodsen_US
dc.titleA new type of conjugate gradient methods with sufficient descent property for unconstrained optimizationen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
tesis QA 218 .A2 2014 Abstract.pdf
Size:
794.66 KB
Format:
Adobe Portable Document Format
Description:
Download
No Thumbnail Available
Name:
tesis QA 218 .A2 2014 FullText.pdf
Size:
22.11 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Pusat Pengajian Informatik dan Matematik Gunaan