Pattern search algorithms for bound constrained minimization

SIAM Journal on Optimization

Volumn 9, Issue 4, 1999, Pages 1082-1099

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

^a NASA LANGLEY RESEARCH CENTER   (United States)

^b The College of William and Mary   (United States)

Author keywords

Alternating variable search; Axial relaxation; Bound constrained optimization; Convergence analysis; Coordinate search; Direct search methods; Evolutionary operation; Globalization strategies; Local variation; Multidirectional search; Pattern search methods

Indexed keywords

EID: 0033412824     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496300507     Document Type: Article

References (17)

1. G. E. P. Box, Evolutionary operation: A method for increasing industrial productivity, Appl. Statist., 6 (1957), pp. 81-101.
2. G. E. P. Box AND K. B. WlLSON, On the experimental attainment of optimum conditions, J. Roy. Statist. Soc. Ser. B, XIII (1951), pp. 1-45.
3. M. J. BOX, D. DAVIES, AND W. H. SWANN, Non-Linear Optimization Techniques, ICI Monograph 5, Oliver & Boyd, Edinburgh, Scotland, 1969.
4. J. V. BURKE AND J. J. MORÉ, On the identification of active constraints, SIAM J. Numer. Anal., 25 (1988), pp. 1197-1211.
5. P. H. CALAMAI AND J. J. MORÉ, Projected gradient methods for linearly constrained problems, Math. Programming, 39 (1987), pp. 93-116.
6. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal., 25 (1988), pp. 433-460.
7. J. E. DENNIS, JR. AND V. TORCZON, Direct search methods on parallel machines, SIAM J. Optim., 1 (1991), pp. 448-474.
8. J. C. DUNN, Global and asymptotic convergence rate estimates for a class of projected gradient processes, SIAM J. Control Optim., 19 (1981), pp. 368-400.
9. R. HOOKE AND T. A. JEEVES, Direct search solution of numerical and statistical problems, J. Assoc. Comput. Mach., 8 (1961), pp. 212-229.
10. D. L. KEEFER, Simpat: Self-bounding direct search method for optimization, Indust. Engrg. Chem. Process Design Develop., 12 (1973), pp. 92-99.
11. R. M. LEWIS AND V. J. TORCZON, Pattern search methods for linearly constrained minimization, SIAM J. Optim., to appear.
12. J. A. NELDER AND R. MEAD, A simplex method for function minimization, Comput. J., 7 (1965), pp. 308-313.
13. W. SPENDLEY, G. R. HEXT, AND F. R. HIMSWORTH, Sequential application of simplex designs in optimisation and evolutionary operation, Technometrics, 4 (1962), pp. 441-461.
14. W. H. SWANN, Direct search methods, in Numerical Methods for Unconstrained Optimization, W. Murray, ed., Academic Press, London, New York, 1972, pp. 13-28.
15. V. TORCZON, Multi-Directional Search: A Direct Search Algorithm for Parallel Machines, Ph.D. thesis, Department of Mathematical Sciences, Rice University, Houston, TX, 1989; available as Tech. report 90-07, Department of Computational and Applied Mathematics, Rice University, Houston, TX.
16. V. TORCZON, On the convergence of pattern search algorithms, SIAM J. Optim., 7 (1997), pp. 1-25.
17. M. W. TROSSET AND V. TORCZON, Numerical Optimization Using Computer Experiments, ICASE Report No. 97-38, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, 1997.