We use cookies to enhance your experience on our website. By continuing to use our website, you are agreeing to our use of cookies. You can change your cookie settings at any time. Find out more Skip to Main Content

Blast from the Past

Enjoy free access to our collection of the 10 most influential and historically significant papers published during The Computer Journal's impressive history.

A Simplex Method for Function Minimization
J. A. Nelder and R. Mead
The Computer Journal (1965) 7 (4): 308-313

A Rapidly Convergent Descent Method for Minimization
R. Fletcher and M.J.D. Powell
The Computer Journal (1963) 6 (2): 163-168

An efficient method for finding the minimum of a function of several variables without calculating derivatives
M. J. D. Powell
The Computer Journal (1964) 7 (2): 155-162

Function minimization by conjugate gradients
R. Fletcher and C. M. Reeves
The Computer Journal (1964) 7 (2): 149-154

A new approach to variable metric algorithms
R. Fletcher
The Computer Journal (1970) 13 (3): 317-322

An Automatic Method for Finding the Greatest or Least Value of a Function
H. H. Rosenbrock
The Computer Journal (1960) 3 (3): 175-184

A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
G.N. Lance and W.T Williams
The Computer Journal (1967) 9 (4): 373-380

A New Method of Constrained Optimization and a Comparison with Other Methods
M.J. Box
The Computer Journal (1965) 8 (1): 42-52

A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
M. J. D. Powell
The Computer Journal (1965) 7 (4): 303-307

Computing the n-dimensional Delaunay tessellation with application to Voroni polytopes
D. F. Watson
The Computer Journal (1981) 24 (2): 167-172

This Feature Is Available To Subscribers Only

Sign In or Create an Account

This PDF is available to Subscribers Only

View Article Abstract & Purchase Options

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Subscribe Now