Skip to main content
SpringerLink
Log in

A novel three-phase trajectory informed search methodology for global optimization

  • Original Article
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A new deterministic method for solving a global optimization problem is proposed. The proposed method consists of three phases. The first phase is a typical local search to compute a local minimum. The second phase employs a discrete sup-local search to locate a so-called sup-local minimum taking the lowest objective value among the neighboring local minima. The third phase is an attractor-based global search to locate a new point of next descent with a lower objective value. The simulation results through well-known global optimization problems are shown to demonstrate the efficiency of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Al Baali M. (1999). Improved Hessian approximation for the limited memory BFGS method. Numer. Algorithms, 22:99–112

    Article  Google Scholar 

  2. Barhen J., Protopopescu V., Reister D. (1997). TRUST: a deterministic algorithm for global optimization. Science, 276:1094–1097

    Article  Google Scholar 

  3. Battiti R., Tecchiolli G. (1996). The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization. Ann. Oper. Res. 63:153–188

    Article  Google Scholar 

  4. Bessaou M., Siarry P. (2001). A genetic algorithm with real-value coding to optimize multimodal continuous functions. Struct. Multidisc. Optim. 23:63–74

    Article  Google Scholar 

  5. Brown A.A., Bartholomew-Biggs M.C. (1989). Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations. J. Optim. Theory Appl. 62:211–224

    Article  Google Scholar 

  6. Chelouah R., Siarry P. (2000). Tabu search applied to global optimization. Eur. J. Oper. Res. 123:256–270

    Article  Google Scholar 

  7. Cetin B.C., Barhen J., Burdick J.W. (1993). Terminal repeller unconstrained subenergy tunnelling. J. Optim. Theory Appl. 77(1):97–126

    Article  Google Scholar 

  8. Chua L.O., Lin G.N. (1984). Nonlinear optimization with constraints. IEEE Trans. Circ. Syst. CAS-31:182–188

    Article  Google Scholar 

  9. Chua L.O. (1990). Global optimization: a naive approach. IEEE Trans. Circ. Syst. 37:966–969

    Article  Google Scholar 

  10. Cvijovic D., Klinowski J. (1995). Taboo search: An approach to the multiple minima problem. Science 267:664

    Article  Google Scholar 

  11. Di Fiore C., Fanelli S., Lepore F., Zellini P. (2003). Matrix algebras in Quasi-Newton methods for unconstrained minimization. Numer. Math. 94:479–500

    Article  Google Scholar 

  12. Floudas C.A., Pardalos P.M. (1992). Recent advances in Global Optimization. Princeton series in Computer science, NJ

    Google Scholar 

  13. Gorman R.P., Sejnowski T.J. (1988). Analysis of hidden units in a layered network trained to classify sonar targets. Neural Netw. 1:75–89

    Article  Google Scholar 

  14. Guckenheimer J., Homes P. (1986). Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields. Applied math. sci. vol. 42. Springer, New York

    Google Scholar 

  15. Haykin S. (1999). Neural Networks: A Comprehensive Foundation. Prentice-Hall, New York

    Google Scholar 

  16. Hedar A., Fukushima M. (2003). Minimizing multimodal functions by simplex coding genetic algorithm. Optim. Methods Softw. 18:265–282

    Article  Google Scholar 

  17. Horst R., Pardalos P.M. (1994). Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  18. Huyer W., Neumaier A. (1999). Global optimization by multilevel coordinate search. J. Global Optim. 14:331–355

    Article  Google Scholar 

  19. Jongen H.Th., Jonker P., Twilt F. (1986). Nonlinear Optimization in ℜn. Peter Lang Verlag, Frankfurt

    Google Scholar 

  20. Kan A.H.G.R., Timmer G.T. (1985). A stochastic approach to global optimization. In: Boggs P.T., Byrd R.H., Schnabel R.B. (eds) Numerical Optimization. SIAM, Philadelphia, PA, pp. 245–262

    Google Scholar 

  21. Kelley C.T. (1999). Detection and remediation of stagnation in the Nelder-Mead algorithm using a sufficient decrease condition. SIAM J. Optim. 10:43–55

    Article  Google Scholar 

  22. Kirkpatrick S., Gelatt C.D., Timer G.T. (1983). Optimization by simulated annealing. Science 220:671–680

    Article  Google Scholar 

  23. Lee J. (2003). Dynamic gradient approaches to compute the closest unstable equilibrium point for stability region estimate and their computational limitations. IEEE Trans. Autom. Control 48(2):321–324

    Article  Google Scholar 

  24. Levy A.V., Montalvo A. (1985). The tunnelling algorithm for the global minimization of functions. SIAM J. Sci. Stati. Comput. 6:15–29

    Article  Google Scholar 

  25. Michalewicz Z. (1996). Genetic Algorithms  +  Data Structures  =  Evolution Programs. Springer, Berlin

    Google Scholar 

  26. Nelder J.A., Mead R. (1965). A simplex method for function minimization. Comput. J. 7:308–313

    Google Scholar 

  27. Nocedal J.N., Wright S.J. (1999). Numerical Optimization. Springer-verlag, New York, Heidelberg, Berlin

    Book  Google Scholar 

  28. Ratschek H., Rokne J. (1988). New Computer Methods for Global Optimization. Ellis Horwood, Chichester, UK

    Google Scholar 

  29. Tank D.W., Hopfield J.J. (1986). Simple ‘neural’ optimization networks: an A/D converter, signal decision circuit, and a linear porgramming circuit. IEEE Trans. Circ. Sys. CAS-33(5):533–541

    Article  Google Scholar 

  30. Vavasis S. (1990). Nonlinear Optimization: Complexity Issues. Springer-Verlag, New York

    Google Scholar 

  31. Yao Y. (1989). Dynamic tunnelling algorithm for global optimization. IEEE Trans. Sys. Man Cybern. 19:1222–1230

    Article  Google Scholar 

  32. Yong L., Lishan K., Evans D.J. (1995). The annealing evolution algorithm as function optimizer. Parallel Comput. 21:389

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Pohang University of Science and Technology, Pohang, Kyungbuk, 790-784, Korea

    Jaewook Lee

Authors
  1. Jaewook Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaewook Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, J. A novel three-phase trajectory informed search methodology for global optimization. J Glob Optim 38, 61–77 (2007). https://doi.org/10.1007/s10898-006-9083-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-006-9083-3

Keywords

Search

Navigation