An efficient method for finding the minimum of a function of several variables without calculating derivatives Export

@article{citeulike:1001884, abstract = {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. 10.1093/comjnl/7.2.155}, author = {Powell, M. J. D.}, citeulike-article-id = {1001884}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/comjnl/7.2.155}, citeulike-linkout-1 = {http://comjnl.oxfordjournals.org/cgi/content/abstract/7/2/155}, day = {1}, doi = {10.1093/comjnl/7.2.155}, journal = {The Computer Journal}, keywords = {algorithm, programmi}, month = {February}, number = {2}, pages = {155--162}, posted-at = {2009-09-14 15:39:32}, priority = {2}, title = {An efficient method for finding the minimum of a function of several variables without calculating derivatives}, url = {http://dx.doi.org/10.1093/comjnl/7.2.155}, volume = {7}, year = {1964} }

TY - JOUR ID - citeulike:1001884 L3 - citeulike-article-id:1001884 N2 - 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. 10.1093/comjnl/7.2.155 IS - 2 JF - The Computer Journal EP - 162 TI - An efficient method for finding the minimum of a function of several variables without calculating derivatives VL - 7 SP - 155 KW - algorithm KW - programmi AU - Powell, MJD PY - 1964/02/01/ UR - http://dx.doi.org/10.1093/comjnl/7.2.155 ER -