Abstract
We consider the global minimization of a bound-constrained function with a so-called funnel structure. We develop a two-phase procedure that uses sampling, local optimization, and Gaussian smoothing to construct a smooth model of the underlying funnel. The procedure is embedded in a trust-region framework that avoids the pitfalls of a fixed sampling radius. We present a numerical comparison to three popular methods and show that the new algorithm is robust and uses up to 20 times fewer local minimizations steps.
Similar content being viewed by others
References
D.H. Ackley, A Connectionist Machine for Genetic Hillclimbing, Kluwer Academic Publishers, Boston, 1987.
B. Addis, Global Optimization using Local Searches, Ph.D. thesis, Universitá degli Studi di Firenze, Dipartimento di Sistemi e Informaticai, Firenze, Italy, 2004.
B. Addis, M. Locatelli, and F. Schoen, “Local optima smoothing for global optimization,” Technical report DSI 5-2003, Dipartimento Sistemi e Informatica, Universitá di Firenze, Firenze, Italy, 2003.
A.R. Conn, N. Gould, and Ph.L. Toint, Trust-Region Methods, SIAM, Philadelphia, 2000.
E.D. Dolan and J. Moré, Benchmarking optimization software with COPS, Technical Report MCS-TM-246, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, November, 2000.
J.P.K. Doye, “Physical perspectives on the global optimization of atomic clusters,” in J. D. Pinter, (ed.), Selected Case Studies in Global Optimization, in press. Kluwer Academic Publishers, Dordrecht, 2002.
R.H. Leary, Global optimization on funneling landscapes. J. Global Optim., vol. 18, no. 4, pp. 367–383, 2000.
K. Levenberg, “A method for the solution of certain problems in least squares,” Quart. Appl. Math., vol. 2, pp. 164–168, 1944.
A. Levy and A. Montalvo, “The tunneling method for global optimization,” SIAM J. Sci. and Stat. Comp., vol. 1, pp. 15–29, 1985.
D. Liu and J. Nocedal, “On the limited memory BFGS method for large scale optimization,” Math. Prog., B, vol. 45, pp. 503–528, 1989.
M. Locatelli, “On the multilevel structure of global optimization problems,” To appear in Computational Optimization and Applications, 2003.
M. Locatelli and F. Schoen, “Random linkage: A family of acceptance/rejection algorithms for global optimisation,” Math. Prog., vol. 85, no. 2, pp. 379–396, 1999.
J.J. Moré and Z. Wu, ”Smoothing techniques for macromolecular global optimization,” in G.D. Pillo and F. Gianessi, (eds.), Nonlinear Optimization and Applications, Plenum Press, New York, 1996, pp. 297–312.
J.J. Moré and Z. Wu, “Global continuation for distance geometry problems,” SIAM J. Optim., vol. 7, pp. 814–836, 1997.
A.H.G. Rinnooy Kan and G. Timmer, “Stochastic global optimization methods,” Part II: Multilevel methods. Math. Prog., vol. 39, pp. 57–78, 1987.
F. Schoen, “Stochastic global optimization: Two phase methods,” in C. Floudas and P. Pardalos (eds.), Encyclopedia of Optimization, Kluwer Academic Publishers, Dordrecht, 2001, pp. 301–305.
F. Schoen, “Two-phase methods for global optimization,” in P. Pardalos and E.H. Romeijn (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, 2002, vol. 2, pp. 151–178.
H.P. Schwefel, Numerical Optimization of Computer Models, J. Wiley & Sons, Chichester, 1981.
C.S. Shao, R.H. Byrd, E. Eskow, and R.B. Schnabel, “Global optimization for molecular clusters using a new smoothing approach,” in L.T. Biegler, T.F. Coleman, A.R. Conn, and F.N. Santosa (eds.), Large Scale Optimization with Applications: Part III: Molecular Structure and Optimization, Springer, New York, 1997, pp. 163–199.
A. Törn and A. Žilinskas, Global Optimization, Lecture Notes in Computer Sciences, vol. 350. Springer-Verlag, Berlin, 1989.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Addis, B., Leyffer, S. A Trust-Region Algorithm for Global Optimization. Comput Optim Applic 35, 287–304 (2006). https://doi.org/10.1007/s10589-006-8716-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-006-8716-2