Abstract
An extension of the global convergence framework for unconstrained derivative-free optimization methods is presented. The extension makes it possible for the framework to include optimization methods with varying cardinality of the ordered direction set. Grid-based search methods are shown to be a special case of the more general extended global convergence framework. Furthermore, the required properties of the sequence of ordered direction sets listed in the definition of grid-based methods are relaxed and simplified by removing the requirement of structural equivalence.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lewis, R. M., Torczon, V., Trosset, M. W.: Direct search methods: then and now. Journal of Computational and Applied Mathematics, (1–2), 191–207 (2000)
Wright, M. H.: Direct search methods: once scorned, now respectable, in Griffiths, D. F., Watson, G. A., Numerical Analysis 1995, Addison-Wesley Longman, Reading, MA, 191–208 (1996)
Powell, M. J. D.: Direct search algorithms for optimization calculations, Acta Numerica, 287–336 (1998)
Yu, W. C.: Positive basis and a class of direct search techniques. Scientia Sinica, Special Issue of Mathematics, 1, 53–67 (1979)
Torczon, V.: Multi-directional search: A direct search method for parallel machines, Ph. D. thesis, Department of Mathematical Sciences, Rice University, Houston, TX (1989)
Torczon, V.: On the convergence of pattern search algorithms. SIAM Journal on Optimization, 7, 1–25 (1997)
Lucidi, S., Sciandrone, M.: On the global convergence of derivative-free methods for unconstrained optimization. SIAM Journal on Optimization, 13, 97–116 (2002)
Grippo, L., Lampariello, F., Lucidi, S.: Global convergence and stabilization of unconstrained minimization methods without derivatives. Journal of Optimization Theory and Applications, 3, 385–406 (1988)
Coope, I. D., Price, C. J.: On the convergence of grid-based methods for unconstrained optimization. SIAM Journal on Optimization, 4, 859–869 (2001)
Coope, I. D., Price, C. J.: A direct search conjugate directions algorithm for unconstrained minimization, Tech. Rep. 188, Department of Mathematics & Statistics, University of Canterbury, Christchurch, New Zealand (1999)
Lewis, R. M., Torczon, V.: Rank ordering and positive bases in pattern search algorithms, Tech. Rep. 96–71, Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA (1996)
Davis, C.: Theory of positive linear dependence. American Journal of Mathematics, 83–108 (1954)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bűrmen, Á., Bratković, F., Puhan, J. et al. Extended Global Convergence Framework for Unconstrained Optimization. Acta Math Sinica 20, 433–440 (2004). https://doi.org/10.1007/s10114-004-0340-4
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10114-004-0340-4