Skip to main content
SpringerLink
Log in

Order statistics and region-based evolutionary computation

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

Abstract

Trust region algorithms are well known in the field of local continuous optimization. They proceed by maintaining a confidence region in which a simple, most often quadratic, model is substituted to the criterion to be minimized. The minimum of the model in the trust region becomes the next starting point of the algorithm and, depending on the amount of progress made during this step, the confidence region is expanded, contracted or kept unchanged. In the field of global optimization, interval programming may be thought as a kind of confidence region approach, with a binary confidence level: the region is guaranteed to contain the optimum or guaranteed to not contain it. A probabilistic version, known as branch and probability bound, is based on an approximate probability that a region of the search space contains the optimum, and has a confidence level in the interval [0,1]. The method introduced in this paper is an application of the trust region approach within the framework of evolutionary algorithms. Regions of the search space are endowed with a prospectiveness criterion obtained from random sampling possibly coupled with a local continuous algorithm. The regions are considered as individuals for an evolutionary algorithm with mutation and crossover operators based on a transformation group. The performance of the algorithm on some standard benchmark functions is presented.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Table of Lennard-Jones cluster global minima. http://doye.chem.ox.ac.uk/jon/structures/LJ/tables.150.html

  2. Zhigljavsky, A.: Theory of global random search. Kluwer Academic Publishers, Dordrecht (1991)

    Book  Google Scholar 

  3. Applebaum, D., Kunita, H.: Levy flows on manifolds and levy processes on lie groups. Journal of Math. Kyoto Univ. 33, (1993)

  4. Arsigny, V., Fillard, P., Pennec, X., Ayache, N.: Geometric means in a novel vector space structure on symmetric positivedefinite matrices. SIAM. J. Matrix Anal. Appl. 29(1), 328–347 (2006)

    Article  Google Scholar 

  5. Shumeet Baluja and Rich Caruana: Removing the genetics from the standard genetic algorithm. Technical report, Carnegie Mellon University, Pittsburgh, PA, USA, (1995)

  6. Bonnans, J.F., Gilbert, J.C., Lemarchal, C., Sagastizabal, C.A.: Numerical optimization. Universitext, Springer, Berlin (2006)

    Google Scholar 

  7. Conn, A.A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM series on optimization. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), (2009)

  8. Dekkers, A.J.H.J., Ferreira, De Haan, L.: On maximum likelihood estimation of the extreme value index. Ann. Appl. Prob. 14(3), 1179–1201 (2004)

    Article  Google Scholar 

  9. Dekkers, A.L.M., Einmahl, J.H.J., De Haan, L.: A moment estimation for the index of an extreme value distribution. Ann. Stat. 17, 1833–1855 (1989)

    Article  Google Scholar 

  10. Drees, H.: Refined pickands estimators of the extreme value index. Ann. Stat. 23(6), 2059–2080 (1995)

    Article  Google Scholar 

  11. Hall, P.: On estimating the endpoint of a distribution. Ann. Stat. 10, 556–568 (1982)

    Article  Google Scholar 

  12. Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of the 1996 IEEE International Conference on, Evolutionary Computation, pp. 312–317 (1996)

  13. Hill, B.M.: A simple general approach to inference about the tail of a distribution. Ann. Stat. 3, 1163–1174 (1975)

    Article  Google Scholar 

  14. Knapp, A.W.: Lie Groups Beyond An Introduction. Progress in Mathematics. Birkhauser Boston Inc., Boston (2002)

    Google Scholar 

  15. Milnor, J.: Morse Theory. Princeton University Press, Princeton (1963)

    Google Scholar 

  16. Pickands, J.: Statistical inference using extreme order statistics. Ann. Stat. 3, 119–131 (1975)

    Article  Google Scholar 

  17. Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)

    Google Scholar 

  18. Storn, R., Price, K.: Differential evlution—a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)

    Article  Google Scholar 

  19. Wierstra, D., Schaul, T., Glasmachers, T., Sun, Y., Schmidhuber, J.: Natural evolution strategies. arXiv:1106.4487v1

  20. Zhigljavsky, A.A.: Semiparametric statistical inference in global random search. Acta. Appl. Math. 33(1), 69–88 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MAIAA Laboratory, ENAC, Toulouse, France

    S. Puechmorel & D. Delahaye

Authors
  1. S. Puechmorel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Delahaye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. Puechmorel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Puechmorel, S., Delahaye, D. Order statistics and region-based evolutionary computation. J Glob Optim 59, 107–130 (2014). https://doi.org/10.1007/s10898-013-0079-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-013-0079-5

Keywords

Search

Navigation