A Sequential Simplex Program for Solving Minimization Problems
作者:
OlssonD. M.,
期刊:
Journal of Quality Technology
(Taylor Available online 1974)
卷期:
Volume 6,
issue 1
页码: 53-57
ISSN:0022-4065
年代: 1974
DOI:10.1080/00224065.1974.11980616
出版商: Taylor&Francis
关键词: Minimization;Non-Linear Least Squares;Optimization;Simplex
数据来源: Taylor
摘要:
Nelder and Mead [2] have developed a simple, robust direct-search procedure for finding the minimum of a function. It consists of evaluating a function ofnvariables at the (n+ 1) vertices of a general simplex. The simplex is then moved away from the largest function value by replacing the vertex having this value with one located by reflection through the centroid of the other vertices. Extension or contraction is then applied depending on the contours of the response surface. This continues until either the specified number of trials has been used, the function values differ among themselves by less than a specified amount, or the coordinates of the function are changing by less than a specified amount.
点击下载:
PDF (520KB)
返 回