Direct search methods: Then and now

Journal of Computational and Applied Mathematics

Volumn 124, Issue 1-2, 2000, Pages 191-207

  Lewis, Robert Michael ^a   Torczon, Virginia ^a,b   Trosset, Michael W ^a,b  

^a NASA LANGLEY RESEARCH CENTER   (United States)

^b Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; HEURISTIC METHODS;

DERIVATIVE-FREE OPTIMIZATION; DIRECT SEARCH METHODS; PATTERN SEARCH METHODS;

MATHEMATICAL PROGRAMMING;

EID: 0034545694     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00423-4     Document Type: Article

References (31)

1. L. Armijo Minimization of functions having Lipschitz continuous first partial derivatives Pacific J. Math. 16 1966 1 3
2. G. Berman Lattice approximations to the minima of functions of several variables J. Assoc. Comput. Mach. 16 1969 286 294
3. G.E.P. Box Evolutionary operation: a method for increasing industrial productivity Appl. Statist. 6 1957 81 101
4. G.E.P. Box K.B. Wilson On the experimental attainment of optimum conditions J. Roy. Statist. Soc. Ser. B XIII 1951 1 45
5. M.J. Box A comparison of several current optimization methods, and the use of transformations in constrained problems Comput. J. 9 1966 67 77
6. M.J. Box D. Davies W.H. Swann Non-Linear Optimization Techniques, ICI Monograph, No. 5 1969 Oliver & Boyd Edinburgh
7. J. Céa Optimisation: Théorie et Algorithmes 1971 Dunod Paris
8. W.C. Davidon, Variable metric method for minimization, SIAM J. Optim. 1 (1991) 1–17 (the article was originally published as Argonne National Laboratory Research and Development Report 5990, May 1959 (revised November 1959)).
9. R. Fletcher Function minimization without evaluating derivatives — a review Comput. J. 8 1965 33 41
10. R. Fletcher M.J.D. Powell A rapidly convergent descent method for minimization Comput. J. 6 1963 163 168
11. A.A. Goldstein Constructive Real Analysis 1967 Harper & Row New York
12. R. Hooke T.A. Jeeves Direct search solution of numerical and statistical problems J. Assoc. Comput. Mach. 8 1961 212 229
13. J.C. Lagarias J.A. Reeds M.H. Wright P.E. Wright Convergence properties of the Nelder–Mead simplex method in low dimensions SIAM J. Optim. 9 1998 112 147
14. R.M. Lewis, V. Torczon, M.W. Trosset, Why pattern search works, Optima (1998) 1–7.
15. R.M. Lewis, V.J. Torczon, Rank ordering and positive bases in pattern search algorithms, Technical Report 96-71, Institute for Computer Applications in Science and Engineering, Mail Stop 132C, NASA Langley Research Center, Hampton, VA 23681–2199, 1996.
16. K.I.M. McKinnon Convergence of the Nelder–Mead simplex method to a nonstationary point SIAM J. Optim. 9 1998 148 158
17. J.A. Nelder R. Mead A simplex method for function minimization Comput. J. 7 1965 308 313
18. E. Polak Computational Methods in Optimization: A Unified Approach 1971 Academic Press New York
19. M.J.D. Powell An efficient method for finding the minimum of a function of several variables without calculating derivatives Comput. J. 7 1964 155 162
20. H.H. Rosenbrock An automatic method for finding the greatest or least value of a function Comput. J. 3 1960 175 184
21. W. Spendley G.R. Hext F.R. Himsworth Sequential application of simplex designs in optimisation and evolutionary operation Technometrics 4 1962 441 461
22. W.H. Swann, Report on the development of a new direct search method of optimization, Research Note 64/3, I.C.I. Central Instrument Lab, 1964.
23. W.H. Swann Direct search methods W. Murray Numerical Methods for Unconstrained Optimization 1972 Academic Press New York 13 28
24. V. Torczon, Multi-directional search: a direct search algorithm for parallel machines, Ph.D. Thesis, Department of Mathematical Sciences, Rice University, Houston, Texas, 1989.
25. V. Torczon On the convergence of the multidirectional search algorithm SIAM J. Optim. 1 1991 123 145
26. V. Torczon On the convergence of pattern search algorithms SIAM J. Optim. 7 1997 1 25
27. M.W. Trosset I know it when I see it: toward a definition of direct search methods SIAG/OPT Views-and-News 9 1997 7 10
28. F.H. Walters, L.R. Parker Jr., S.L. Morgan, S.N. Deming, Sequential Simplex Optimization, Chemometrics Series, CRC Press, Boca Raton, FL, 1991.
29. P. Wolfe Convergence conditions for ascent methods SIAM Rev. 11 1969 226 235
30. M.H. Wright Direct search methods: once scorned, now respectable D.F. Griffiths G.A. Watson Numerical Analysis 1995 1996 Addison-Wesley Longman Reading, MA 191 208
31. W.I. Zangwill Minimizing a function without calculating derivatives Comput. J. 10 1967 293 296