A Survey of Numerical Methods for Unconstrained Optimization
SIAM ReviewPublished 1 January 1970
M. J. D. Powell
Citations113
SJR quartileQ1
SJR score3.02
SNIP5.22
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
This paper is intended to introduce and relate the more successful numerical methods for calculating the greatest value of a given real function $F(x_1 ,x_2 , \ldots ,x_n )$. It also indicates some directions for research.
Keywords
Computer ScienceMathematics
Journal of the Society for Industrial and Applied MathematicsAn Algorithm for Least-Squares Estimation of Nonlinear Parameters
30,435 Citations1963Donald W. Marquardt
The Computer JournalA Simplex Method for Function Minimization
28,856 Citations1965J. A. Nelder, R. Mead
A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n 41) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point.
Journal of research of the National Bureau of StandardsMethods of conjugate gradients for solving linear systems
8,037 Citations1952Magnus R. Hestenes, Eduard Stiefel
An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns and it is shown that this method is a special case of a very general method which also includes Gaussian elimination.
The Computer JournalA Rapidly Convergent Descent Method for Minimization
4,571 Citations1963R. Fletcher, M. J. D. Powell
The Computer JournalAn efficient method for finding the minimum of a function of several variables without calculating derivatives
4,548 Citations1964M. J. D. Powell
Journal of the ACM`` Direct Search'' Solution of Numerical and Statistical Problems
4,258 Citations1961Robert Hooke, T. A. Jeeves
The phrase "direct search" is used to describe sequential examination of trial solutions involving comparison of each trial solution with the "best" obtained up to that time together with a strategy for determining (as a function of earlier results) what the next trial solution will be.
The Computer JournalAn Automatic Method for Finding the Greatest or Least Value of a Function
2,945 Citations1960H.H. Rosenbrock
TechnometricsSequential Application of Simplex Designs in Optimisation and Evolutionary Operation
1,285 Citations1962W. Spendley, G. R. Hext +1 more
A technique for empirical optimisation is presented in which a sequence of experimental designs each in the form of a regular or irregular simplex is used, each simplex having all vertices but one in common with the preceding simplex, and being completed by one new point.
Mathematics of ComputationQuasi-Newton methods and their application to function minimisation
587 Citations1967C. G. Broyden
The Computer JournalVariance algorithm for minimization
512 Citations1968William C. Davidon
An algorithm is presented for minimizing real valued differentiable functions on an TV-dimensional manifold and a proof is given for convergence within iV-iterations to the exact minimum and variance matrix for quadratic functions.
The Computer JournalA Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
375 Citations1966M. J. Box
Transitions whereby inequality constraints of certain forms can be eliminated from the formulation of an optimization problem are described, and examples of their use compared with other methods for handling such constraints are described.
The Computer JournalMinimizing a function without calculating derivatives
261 Citations1967W. I. Zangwill
The Computer JournalFunction Minimization Without Evaluating Derivatives--a Review
216 Citations1965R. Fletcher
The problem of minimizing a function/(x) of n variables x = (xu x2, • • • xn) from a given approximation to the minimum XQ, has received considerable attention in recent years and two separate problems can be distinguished.
Journal of the ACMA Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
204 Citations1967G. W. Stewart
A modification of Davidon's method for the unconstrained minimization of a function of several variables is proposed in which the gradient vector is approximated by differences.
The Computer JournalAn Iterative Method for Finding Stationary Values of a Function of Several Variables
196 Citations1962M. J. D. Powell
An iterative method which is not unlike the conjugate gradient method of Hestenes and Stiefel (1952), and which finds stationary values of a general function, which has second-order convergence.
Mathematics of ComputationOn the relative efficiencies of gradient methods
123 Citations1967John Greenstadt
Numerische MathematikOn the asymptotic directions of thes-dimensional optimum gradient method
108 Citations1968George E. Forsythe
Journal of the Society for Industrial and Applied MathematicsSome Algorithms for Minimizing a Function of Several Variables
95 Citations1964Babubhai V. Shah, Robert J. Buehler +1 more
Journal of the Franklin InstituteRecent advances in optimization techniques
32 Citations1968Masanao Aoki
The Computer JournalNote on An Extremum Locating Algorithm
8 Citations1962Robert Baer
The point of this note is to describe a strategy of search rather different from that given by Rosenbrock, and to note its result when applied to the function tested in his paper.