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.
Keywords
Hessian matrixSimplexMinificationNeighbourhood (mathematics)Vertex (graph theory)Simplex algorithmMathematicsMathematical optimizationFunction (biology)Computer scienceCombinatoricsAlgorithmApplied mathematicsLinear programmingGraphMathematical analysis
Related Publications
Fortified-Descent Simplicial Search Method: A General Approach
We propose a new simplex-based direct search method for unconstrained minimization of a real-valued function f of n variables. As in other methods of this kind, the intent is to...
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
The nuclear norm (sum of singular values) of a matrix is often used in convex heuristics for rank minimization problems in control, signal processing, and statistics. Such heuri...
Variance algorithm for minimization
An algorithm is presented for minimizing real valued differentiable functions on an N-dimensional manifold. In each iteration, the value of the function and its gradient are com...
Limiting dilution assays for the determination of immunocompetent cell frequencies. I. Data analysis.
Abstract A statistical method was developed for the analysis of experimental data from limiting dilution assays. Formulas for the estimation of the frequency of immunocompetent ...
A new approach to variable selection in least squares problems
The title Lasso has been suggested by Tibshirani (1996) as a colourful name for a technique of variable selection which requires the minimization of a sum of squares subject to ...
Publication Info
- Year
- 1965
- Type
- article
- Volume
- 7
- Issue
- 4
- Pages
- 308-313
- Citations
- 28289
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
28289
OpenAlex
Cite This
J. A. Nelder,
R. Mead
(1965).
A Simplex Method for Function Minimization.
The Computer Journal
, 7
(4)
, 308-313.
https://doi.org/10.1093/comjnl/7.4.308
Identifiers
- DOI
- 10.1093/comjnl/7.4.308