On the global convergence of derivative-free methods for unconstrained optimization

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 97-116

  Lucidi, Stefano ^a   Sciandrone, Marco ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

Author keywords

Derivative free methods; Unconstrained minimization

Indexed keywords

EID: 0037289078     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497330392     Document Type: Article

References (20)

1. R. DE LEONE, M. GAUDIOSO, AND L. GRIPPO, Stopping criteria for linesearch methods without derivatives, Math. Programming, 30 (1984), pp. 285-300.
2. J. E. DENNIS, JR., AND V. TORCZON, Direct search methods on parallel machines, SIAM J. Optim., 1 (1991), pp. 448-474.
3. T. GLAD AND A. GOLDSTEIN, Optimization of functions whose values are subject to small errors, BIT, 17 (1977), pp. 160-169.
4. L. GRIPPO, A class of unconstrained minimization methods for neural network training, Optim. Methods Softw., 4 (1994), pp. 135-150.
5. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, Global convergence and stabilization of unconstrained minimization methods without derivatives, J. Optim. Theory Appl., 56 (1988), pp. 385-406.
6. R. HOOKE AND T. A. JEEVES, Direct search solution of numerical and statistical problems, J. ACM, 8 (1961), pp. 212-229.
7. R. M. LEWIS AND V. TORCZON, Rank Ordering and Positive Bases in Pattern Search Algorithms, Technical report TR 96-71, ICASE, NASA Langley Research Center, Hampton, VA, 1996.
8. S. LUCIDI AND M. SCIANDRONE, Numerical .results for unconstrained optimization without derivatives, in Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi, eds., Plenum Publishing, New York, 1995, pp. 261-270.
9. S. LUCIDI AND M. SCIANDRONE, On the Global Convergence of Derivative Free Methods for Unconstrained Optimization without Derivatives, Technical report R. 18-96, DIS, Università di Roma "La Sapienza," Rome, 1996.
10. R. MIFFLIN, A superlinearly convergent algorithm for minimization without evaluating derivatives, Math. Programming, 9 (1975), pp. 100-117.
11. 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-163.
12. M. J. D. POWELL, Unconstrained minimization algorithms without computation derivatives, Boll. Unione Mat. Ital., 9 (1974), pp. 60-69.
13. M. J. D. POWELL, Direct search algorithms for optimization calculations, Acta Numer., 7 (1998), pp. 287-336.
14. A. S. RYKOV, Simplex direct search algorithms, Automat. Remote Control, 41 (1980), pp. 784-793.
15. A. S. RYKOV, Simplex methods of direct search, Engineering Cybernetics, 18 (1980), pp. 12-18.
16. V. TORCZON, On the convergence of pattern search algorithms, SIAM J. Optim., 7 (1997), pp. 1-25.
17. P. TSENG, Fortified-descent simplicial search method: A general approach, SIAM J. Optim., 10 (1999), pp. 269-288.
18. YU WEN-CI, Positive basis and a class of direct search techniques, Scientia Sinica, Special Issue of Mathematics, 1 (1979), pp. 53-67.
19. M. H. WRIGHT, Direct search methods: Once scorned, now respectable, in Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, D. F. Griffiths and G. A. Watson, eds, Addison-Wesley Longman, Harlow, United Kingdom, 1996, pp. 191-208.
20. W. J. ZANGWILL, Minimizing a function without calculating derivatives, Comput. J., 10 (1967), pp. 293-296.