The nelder and mead algorithm: a direct search method for unconstrained optimization
Date
10-1988
Degree
Bachelor of Science in Agriculture
College
College of Arts and Sciences (CAS)
Adviser/Committee Chair
Norberto R. Navarrete Jr.
Abstract
In this paper, the Nelder and Mead Algorithm, a direct search method for unconstrained optimization is studied and implemented into a software. Optimal parameters [step size (h), expansion factor (GAMMA), and contraction factor (BETA), were determined for the optimal performance of the algorithm. The implemented Nelder and Mead algorithm was thereafter compared with the other search algorithms, namely, the algorithms of Hooke and Jeeves, that of Spendley, Hext and Himsworth and of the Grid Seach.
Language
English
Location
UPLB Main Library Special Collections Section (USCS)
Call Number
Thesis
Recommended Citation
Cristi, Ramon P., "The nelder and mead algorithm: a direct search method for unconstrained optimization" (1988). Undergraduate Theses. 9776.
https://www.ukdr.uplb.edu.ph/etd-undergrad/9776
Document Type
Thesis