Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan

Simple item page
dc.contributor.authorMustafa Mamat
dc.date.accessioned2011-05-31T04:12:16Z
dc.date.available2011-05-31T04:12:16Z
dc.date.issued2007-07
dc.description.abstractThe aim of this research is to focus on determining the minimum values of function for unconstrained optimization. Until now, there are various of methods to solve that kinds of problems but just some of them will be discussed. In this study we have tried to built an algorithm which is using hybrid search direction of quasi-Newton and steepest descent. By using this hybrid search direction, we are trying to test on several standard problems by using BFGS, Broyden, PSB and SRI methods. We called that new method which used hybrid search direction as hybrid BFGS, hybrid Broyden, hybrid PSB and hybrid SRI methods. In determination of the efficiency of this algorithm, we compared numerical results for all those methods.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/732
dc.language.isoenen_US
dc.publisherFakulti Sains dan Teknologien_US
dc.subjectQC 20.7.M27 M8 2007en_US
dc.subjectMustafa Mamaten_US
dc.subjectKaedah hibrid arah carian bagi masalah pengoptimuman tak berkekanganen_US
dc.subjectMathematical optimizationen_US
dc.titleKaedah hibrid arah carian bagi masalah pengoptimuman tak berkekanganen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
QC 20.7 .M27 M8 2007 Abstract.pdf
Size:
706.05 KB
Format:
Adobe Portable Document Format
Description:
Download
No Thumbnail Available
Name:
QC 20.7 .M27 M8 2007 FullText.pdf
Size:
20.25 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Fakulti Sains dan Teknologi