Skip Navigation

A Simplex Method for Function Minimization

  1. R. Mead

+ Author Affiliations

  1. National Vegetable Research Station, Wellesbourne, Warwick.

    Abstract

    A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n + 1) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point. The simplex adapts itself to the local landscape, and contracts on to the final minimum. The method is shown to be effective and computationally compact. A procedure is given for the estimation of the Hessian matrix in the neighbourhood of the minimum, needed in statistical estimation problems.

    Articles citing this article

    | Table of Contents

    This Article

    1. The Computer Journal 7 (4): 308-313. doi: 10.1093/comjnl/7.4.308

    - Share

    Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.