Abstract
This paper presents a general approach that combines global search strategies with local search and attempts to find a global minimum of a real valued function of n variables. It assumes that derivative information is unreliable; consequently, it deals with derivative free algorithms, but derivative information can be easily incorporated. This paper presents a nonmonotone derivative free algorithm and shows numerically that it may converge to a better minimum starting from a local nonglobal minimum. This property is then incorporated into a random population to globalize the algorithm. Convergence to a zero order stationary point is established for nonsmooth convex functions, and convergence to a first order stationary point is established for strictly differentiable functions. Preliminary numerical results are encouraging. A Java implementation that can be run directly from the Web allows the interested reader to get a better insight of the performance of the algorithm on several standard functions. The general framework proposed here, allows the user to incorporate variants of well known global search strategies.
Similar content being viewed by others
References
M.M. Ali C. Storey A. Törn (1997) ArticleTitleA numerical comparison of some modified controlled random search algorithms Journal of Global Optimization 11 377–385
M.M. Ali A. Törn (2004) ArticleTitlePopulation set-based global optimization algorithms: some modifications and numerical results Computers and Operations Research 31 1703–1725 Occurrence Handle10.1016/S0305-0548(03)00116-3
Adil M. Bagirov Alexander M. Rubinov John Yearwood (2002) ArticleTitleA global optimization approach to classification Optimization and Engineering 3 129–155 Occurrence Handle10.1023/A:1020911318981
Burguillo, Juan C., García-Palomares, Ubaldo M. and González-Castaño, Francisco J. (2004), Java implementation of the CGLS algorithm, http://www.det.uvigo.es/~jrial/Proyectos/Global/Global.html
T. Csendes D. Ratz (1997) ArticleTitleSubdivision direction selection in interval methods for global optimization SIAM Journal on Numerical Analysis 34 922–938 Occurrence Handle10.1137/S0036142995281528
Ubaldo M. García-Palomares José F. Rodríguez (2002) ArticleTitleNew sequential and parallel derivative-free algorithms for unconstrained optimization SIAM Journal on optimization 13 79–96 Occurrence Handle10.1137/S1052623400370606
R. Ge (2000) ArticleTitleA filled function method for finding a global minimizer of a function of several variables. Mathematical Programming 46 191–204
Gray, P., Hart, W., Painton, L., Phillips, C., Trahan, M. and Wagner, J. (1997), A Survey of Global Optimization Methods, Sandia National Laboratories, http://www.cs.sandia.gov/opt/survey/main.html
L. Grippo F. Lampariello S. Lucidi (1986) ArticleTitleA nonmonotone line search technique for Newton’s method SIAM Journal on Numerical Analysis 23 707–716 Occurrence Handle10.1137/0723046
Albert A. Groenwold J.A. Snyman (2002) ArticleTitleGlobal Optimization using Dynamic Search Trajectories Journal of Global Optimization 24 51–60 Occurrence Handle10.1023/A:1016267007352
D. Haim A.A. Giunta M.M. Holzwarth W.H. Mason L.T. Watson R.T. Haftka (1999) ArticleTitleComparison of optimization software packages for an aircraft multidisciplinary design optimization problem Design optimization 1 9–23
Horst R., Pardalos Panos M. (1994), Handbook of Global Optimization Vol. 1, Kluwer Academic Publishers, ISBN 0-7923-3120-6.
W. Huyer A. Neumaier (1999) ArticleTitleGlobal optimization by multilevel coordinate search Journal of Global Optimization 14 331–355 Occurrence Handle10.1023/A:1008382309369
G. Pintér Isenor D. János M. Cada (2003) ArticleTitleA global optimization approach to laser design Optimization and Engineering 4 177–196 Occurrence Handle10.1023/A:1023985013315
Donald R. Jones (2001) ArticleTitleA taxonomy of global optimization methods on response surfaces Journal of Global Optimization 21 345–383 Occurrence Handle10.1023/A:1012771025575
Donald R. Jones C.D. Pertunen B.E. Stuckman (1993) ArticleTitleLipschitzian optimization without the Lipschitz constant Journal of Optimization Theory and Applications 79 157–181 Occurrence Handle10.1007/BF00941892
Khompatraporn, C. Zabinsky, Z.B. and Pintér J.D. (2004), Comparative assessment of algorithms and software for global optimization, Jurnal of Global Optimization, to appear
R. Hooke T.A. Jeeves (1961) ArticleTitleDirect search solution of numerical and statistical problems Journal ACM 8 212–229
Kolda, Tamara G., Lewis R.M., Torczon V. (2003), Optimization by direct search: new perspectives on some classical and modern methods. SIAM Review 45–3, 385–482.
Levy, A.V. and Gómez S. (1985), The tunneling method applied for the global minimization of functions. In: Boggs, Paul T. (ed.), Numerical Optimization, SIAM, 213–244.
X. Liu W. Xu (2004) ArticleTitleA new filled function applied to global optimization Computers and Operations Research 31 61–80
M. Locatelli F. Schoen (2002) ArticleTitleFast global optimization of difficult Lennard-Jones clusters Computational Optimization and Applications 21 55–70 Occurrence Handle10.1023/A:1013596313166
Pardalos, Panos M., Edwin Romeijn H. (2002), Handbook of Global Optimization Vol. 2, Kluwer Academic Publishers, ISBN 1-4020-0632-2.
Pintér J.D. (1995), Global Optimization in Action (Continuous and Lipschitz optimization: Algorithms, Implementations and Applications), Kluwer Academic Publishers, ISBN 0-7923-3757-3.
W.L. Price (1977) ArticleTitleA controlled random search procedure for global optimization The Computer Journal 20 367–370
W.L. Price (1983) ArticleTitleGlobal optimization by controlled random search Journal of Optimization Theory and Applications 40 333–348 Occurrence Handle10.1007/BF00933504
W.L. Price (1987) ArticleTitleGlobal optimization algorithm for a CAD workstation Journal of Optimization Theory and Applications 55 133–146 Occurrence Handle10.1007/BF00939049
Smith, Sharon L., Eskow, E. and Schnabel, Robert B. (1990), Adaptive, asynchronous stochastic global optimization algorithms. In: Coleman, Thomas F. and Li, Y. (eds.), Large-scale Numerical Optimization, SIAM, ISBN 0-89871-268-8, pp. 207–227.
Stephens, C.P. and Baritompa W. (1998), Global optimization requires global information, Journal of Optimization Theory and Applications 96–3, 575–588.
P.L. Toint (1997) ArticleTitleNon monotone trust region algorithms for non linear optimization subject to convex constraints Mathematical Programming 77 69–94 Occurrence Handle10.1016/S0025-5610(96)00065-2
A. Törn A. Žilinskas (1989) Global Optimization Springer Verlag Berlin, Germany
A. Törn M. Ali S. Viitanen (1999) ArticleTitleStochastic global optimization problem classes and solution techniques Journal of Global Optimization 14 437–447 Occurrence Handle10.1023/A:1008395408187
M. Ulbrichm (2001) ArticleTitleNonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems SIAM Journal on Optimization 11–4 889–917
Wright, M.H. (1996), Direct search methods: Once scorned, now respectable. In: Griffiths, D.F. and Watson G. (eds.) Numerical analysis 1995, Vol.344, Pittman research notes, pp. 191–208.
K.F.C. Yiu Y. Liu K.L. Teo (2004) ArticleTitleA hybrid descent method for global optimization Journal of Global Optimization 28 229–238 Occurrence Handle10.1023/B:JOGO.0000015313.93974.b0
Author information
Authors and Affiliations
Corresponding author
Additional information
Research done under the cooperation agreement between Universidade de Vigo and Universidad Simón Bolívar.
Rights and permissions
About this article
Cite this article
Garcia-Palomares, U.M., Gonzalez-Castaño, F.J. & Burguillo-Rial, J.C. A Combined Global & Local Search (CGLS) Approach to Global Optimization. J Glob Optim 34, 409–426 (2006). https://doi.org/10.1007/s10898-005-3249-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-005-3249-2