1964/02/01 by M. J. D. Powell · 4,622 citations
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Algorithm #Applied mathematics #Computer science #Convergence (economics) #Function (biology) #Iterative Methods for Nonlinear Equations #Key (lock) #Mathematical optimization #Mathematics #Matrix Theory and Algorithms #Quadratic equation #Rate of convergence #Simple (philosophy) #Variation (astronomy)
paper · doi:10.1093/comjnl/7.2.155
published in The Computer Journal 7(2), 155-162 (Oxford University Press)
openalex publication_date 1964/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
A simple variation of the well-known method of minimizing a function of several variables by changing one parameter at a time is described. This variation is such that when the procedure is applied to a quadratic form, it causes conjugate directions to be chosen, so the ultimate rate of convergence is fast when the method is used to minimize a general function. A further variation completes the method, and its ensures that the convergence rate from a bad approximation to a minimum is always efficient. Practical applications of the procedure have proved to be very satisfactory, and numerical examples are given in which functions of up to twenty variables are minimized.