This Is AuburnElectronic Theses and Dissertations

Show simple item record

Comparison of Derivative Free Algorithms in Optimization High Dimension Problems


Metadata FieldValueLanguage
dc.contributor.advisorWilamowski , Bogdanen_US
dc.contributor.authorHao, Jianliangen_US
dc.date.accessioned2015-12-08T16:04:03Z
dc.date.available2015-12-08T16:04:03Z
dc.date.issued2015-12-08
dc.identifier.urihttp://hdl.handle.net/10415/4914
dc.description.abstractGradient free optimization algorithms are often used when gradient information of a function is not available or it is difficult and costly to obtain or estimate. Many kinds of derivative free algorithms are used in the fields of statistics, and engineering. This paper compared five derivative-free optimization algorithms using a set of benchmark functions. Then the comparison results will be reported and discussed. The employed algorithms include Genetic algorithm, Particle Swarm Optimization, Nelder-Mead simplex and Nelder-Mead simplex Plus and quasi Gradient method. This master thesis (1) reviews how each optimization method works in detail; (2) tests the quality of each algorithm in optimizing high dimensional problems; (3) discuss different optimization method’s performance in optimization;(4) choose top performing optimization method solve particular artificial neural networks problems, which is intended to explore the potential of combining derivative free method with artificial neural networks.en_US
dc.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectElectrical Engineeringen_US
dc.titleComparison of Derivative Free Algorithms in Optimization High Dimension Problemsen_US
dc.typeMaster's Thesisen_US
dc.embargo.lengthMONTHS_WITHHELD:9en_US
dc.embargo.statusEMBARGOEDen_US
dc.embargo.enddate2016-08-09en_US

Files in this item

Show simple item record