Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan

The 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 hybr...

Full description

Saved in:

Bibliographic Details
Main Author:	Mustafa Mamat
Format:	Thesis
Language:	English
Subjects:	QC 20.7.M27 M8 2007 Mustafa Mamat Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan Mathematical optimization
Online Access:	http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/1/QC%2020.7%20.M27%20M8%202007%20Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/2/QC%2020.7%20.M27%20M8%202007%20FullText.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-umt-ir.-732
record_format	uketd_dc
spelling	my-umt-ir.-7322016-03-10T07:20:02Z Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan Mustafa Mamat The 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. Fakulti Sains dan Teknologi 2007-07 Thesis en http://hdl.handle.net/123456789/732 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/1/QC%2020.7%20.M27%20M8%202007%20Abstract.pdf 70fc00cc8cdb285be9cd5a9225b8e293 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/2/QC%2020.7%20.M27%20M8%202007%20FullText.pdf 70a4692293e56d586bda9d15562e597b http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/3/license.txt ecca7a0b60eabbf88d99eae3662e2d50 http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/4/QC%2020.7%20.M27%20M8%202007%20Abstract.pdf.txt 284761d3851eecc15f8821ebc24212dc http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/5/QC%2020.7%20.M27%20M8%202007%20FullText.pdf.txt 25d6686824e09d2ea18432e0f23dc18c QC 20.7.M27 M8 2007 Mustafa Mamat Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan Mathematical optimization
institution	Universiti Malaysia Terengganu
collection	UMT Repository System
language	English
topic	QC 20.7.M27 M8 2007 Mustafa Mamat Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan Mathematical optimization
spellingShingle	QC 20.7.M27 M8 2007 Mustafa Mamat Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan Mathematical optimization Mustafa Mamat Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
description	The 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.
format	Thesis
author	Mustafa Mamat
author_facet	Mustafa Mamat
author_sort	Mustafa Mamat
title	Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
title_short	Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
title_full	Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
title_fullStr	Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
title_full_unstemmed	Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
title_sort	kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan
granting_institution	Fakulti Sains dan Teknologi
url	http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/1/QC%2020.7%20.M27%20M8%202007%20Abstract.pdf http://umt-ir.umt.edu.my:8080/jspui/bitstream/123456789/732/2/QC%2020.7%20.M27%20M8%202007%20FullText.pdf
_version_	1747835806838423552

Kaedah hibrid arah carian bagi masalah pengoptimuman tak berkekangan

Similar Items