An efficient method for determining all the extreme points of function with one variable

An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. The algorithm is the combination of the f...

Full description

Saved in:
Bibliographic Details
Main Author: Pandiya, Ridwan
Format: Thesis
Language:en
Published: Terengganu: Universiti Malaysia Terengganu 2014
Subjects:
Online Access:http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3049
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832419533624705024
author Pandiya, Ridwan
author_facet Pandiya, Ridwan
author_sort Pandiya, Ridwan
building Perpustakaan Sultanah Nur Zahirah
collection Institutional Repository
content_provider Universiti Malaysia Terengganu
content_source UMT-IR
continent Asia
country Malaysia
description An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. The algorithm is the combination of the filled function's algorithm and Inner Iteration algorithm, called IRH's algorithm, in which Inner Iteration algorithm works at the domain which is usually ignored by filled function's algorithm.
format Thesis
id my.umt.ir-3049
institution Universiti Malaysia Terengganu
language en
publishDate 2014
publisher Terengganu: Universiti Malaysia Terengganu
record_format dspace
spelling my.umt.ir-30492014-05-18T07:33:20Z An efficient method for determining all the extreme points of function with one variable Pandiya, Ridwan QA 9.58 .P3 2013 Pandiya, Ridwan Tesis FST 2013 Algorithms An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. The algorithm is directly suitable for a class of problems of commonly used in solving the global optimization problems. The algorithm is the combination of the filled function's algorithm and Inner Iteration algorithm, called IRH's algorithm, in which Inner Iteration algorithm works at the domain which is usually ignored by filled function's algorithm. 2014-05-18T07:33:20Z 2014-05-18T07:33:20Z 2013-09 Thesis http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3049 en application/pdf application/pdf Terengganu: Universiti Malaysia Terengganu
spellingShingle QA 9.58 .P3 2013
Pandiya, Ridwan
Tesis FST 2013
Algorithms
Pandiya, Ridwan
An efficient method for determining all the extreme points of function with one variable
title An efficient method for determining all the extreme points of function with one variable
title_full An efficient method for determining all the extreme points of function with one variable
title_fullStr An efficient method for determining all the extreme points of function with one variable
title_full_unstemmed An efficient method for determining all the extreme points of function with one variable
title_short An efficient method for determining all the extreme points of function with one variable
title_sort efficient method for determining all the extreme points of function with one variable
topic QA 9.58 .P3 2013
Pandiya, Ridwan
Tesis FST 2013
Algorithms
url http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3049
url_provider http://umt-ir.umt.edu.my:8080/