Fortified-descent simplicial search method: A general approach

SIAM Journal on Optimization

Volumn 10, Issue 1, 1999, Pages 269-288

  Tseng, Paul ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Direct search; Multidirectional search method; Neider mead method; Unconstrained minimization

Indexed keywords

EID: 0033267174     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495282857     Document Type: Article

References (31)

1. G. E. P. BOX AND K. B. WILSON, On the experimental attainment of optimum conditions, J. Roy. Statist. Soc. Ser. B, XIII (1951), pp. 1-45.
2. M. J. Box, A new method of constrained optimization and a comparison with other methods, Comput. J., 8 (1965), pp. 42-52.
3. A. G. BUCKLEY AND H. MA, A Derivative-Free Algorithm for Parallel and Sequential Optimization, Computer Science Department Report, University of Victoria, BC, Canada, October 1994.
4. J. CÉA, Optimisation: Théorie et algorithmes, Dunod, Paris, 1971.
5. A. P. DAMBRAUSKAS, The simplex optimization method with variable step, Engrg. Cybernet., 1 (1970), pp. 28-36.
6. J. E. DENNIS, JR., AND V. TORCZON, Direct search methods on parallel machines, SIAM J. Optim., 1 (1991), pp. 448-474.
7. J. E. DENNIS, JR., AND D. J. WOODS, Optimization on microcomputers: The Nelder-Mead simplex algorithm, in New Computing Environments: Microcomputers in Large-Scale Computing, A. Wouk, ed., SIAM, Philadelphia, PA, 1987, pp. 116-122.
8. R. FLETCHER, Function minimization without evaluating derivatives - a review, Comput. J., 8 (1965), pp. 33-41.
9. P. GRITZMANN AND V. KLEE, On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes, in Polytopes: Abstract, Convex and Computational, T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivic Weiss, eds., Kluwer, Boston, 1994, pp. 373-466.
10. R. HOOKE AND T. A. JEEVES, "Direct search" solution of numerical and statistical problems, J. Assoc. Comput. Mach., 8 (1961), pp. 212-229.
11. A. G. KUZNETSOV, Nonlinear Optimization Toolbox, Report OUEL 1936/92, Department of Engineering Science, University of Oxford, UK, 1992.
12. J. C. LAGARIAS, J. A. REEDS, M. H. WRIGHT, AND P. E. WEIGHT, Convergence properties of the Nelder-Mead simplex method in low dimensions, SIAM J. Optim., 9 (1999), pp. 112-147.
13. O. L. MANGASARIAN, Nonlinear Programming, McGraw-Hill, New York, 1969.
14. K. I. M. MCKINNON, Convergence of the Nelder-Mead simplex method to a nonstationary point, SIAM J. Optim., 9 (1999), pp. 148-158.
15. J. A. NELDER AND R. MEAD, A simplex method for function minimization, Comput. J., 7 (1965), pp. 308-313.
16. M. J. D. POWELL, An iterative method for finding stationary values of a function of several variables, Comput. J., 5 (1962), p. 147.
17. M. J. D. POWELL, An efficient method for finding the minimum of a function of several variables without calculating derivatives, Comput. J., 7 (1964), pp. 155-162.
18. H. H. ROSENBROCK, An automatic method for finding the greatest or least value of a function, Comput. J., 3 (1960), pp. 175-184.
19. A. S. RYKOV, Simplex direct search algorithms, Automat. Remote Control, 41 (1980), pp. 784-793.
20. A. S. RYKOV, Simplex methods of direct search, Engrg. Cybernet., 18 (1980), pp. 12-18.
21. A. S. RYKOV, Design principles of controlled direct-search methods, Soviet Phys. Dokl., 27 (1982), pp. 794-796.
22. A. S. RYKOV, Simplex algorithms for unconstrained optimization, Problems Control Inform. Theory, 12 (1983), pp. 195-208.
23. W. SPENDLEY, G. R. HEXT, AND F. R. HIMSWORTH, Sequential application of simplex designs in optimisation and evolutionary operation, Technometrica, 4 (1962), pp. 441-461.
24. V. TORCZON, Multi-Directional Search: A Direct Search Algorithm for Parallel Machines, Ph.D. thesis, Rice University, Houston, TX, 1989; available as Technical Report 90-7, Department of Mathematical Sciences, Rice University, Houston, TX.
25. V. TORCZON, On the convergence of the multidirectional search algorithm, SIAM J. Optim., 1 (1991), pp. 123-145.
26. V. TORCZON, On the convergence of pattern search algorithms, SIAM J. Optim., 7 (1997), pp. 1-25.
27. D. J. WOODS, An Interactive Approach for Solving Multi-Objective Optimization Problems, Ph.D. thesis, Rice University, Houston, TX, 1985; available as Technical Report 85-5, Department of Mathematical Sciences, Rice University, Houston, TX.
28. M. H. WRIGHT, Direct search methods: Once scorned, now respectable, in Numerical Analysis 1995 (Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis), Pitman Res. Notes Math. Ser. 344, D. F. Griffiths and G. A. Watson, eds., Longman, Harlow, UK, 1996, pp. 191-208.
29. W.-C. YU, The convergent property of the simplex evolutionary techniques, Sci. Sinica 1979, Special Issue I on Math., pp. 69-77 (in Chinese).
30. W.-C. YU, Positive basis and a class of direct search techniques, Sci. Sinica 1979, Special Issue I on Math., pp. 53-68 (in Chinese).
31. W. I. ZANGWILL, Minimizing a function without calculating derivatives, Comput. J., 10 (1967), pp. 293-296. SIAM J. OPTIM.