A distributed search algorithm for global optimization on numerical spaces

Pierre Courrieu

RAIRO - Operations Research - Recherche Opérationnelle (1993)

  • Volume: 27, Issue: 3, page 281-292
  • ISSN: 0399-0559

How to cite

top

Courrieu, Pierre. "A distributed search algorithm for global optimization on numerical spaces." RAIRO - Operations Research - Recherche Opérationnelle 27.3 (1993): 281-292. <http://eudml.org/doc/105061>.

@article{Courrieu1993,
author = {Courrieu, Pierre},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {global optimization; distributed random search},
language = {eng},
number = {3},
pages = {281-292},
publisher = {EDP-Sciences},
title = {A distributed search algorithm for global optimization on numerical spaces},
url = {http://eudml.org/doc/105061},
volume = {27},
year = {1993},
}

TY - JOUR
AU - Courrieu, Pierre
TI - A distributed search algorithm for global optimization on numerical spaces
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1993
PB - EDP-Sciences
VL - 27
IS - 3
SP - 281
EP - 292
LA - eng
KW - global optimization; distributed random search
UR - http://eudml.org/doc/105061
ER -

References

top
  1. 1. C. G. E. BOENDER, A. H. G. RINNOOY KAN, L. STOUGIE and G. T. TIMMER, A stochastic method for global optimization, Mathematical Programming, 22, 1982, pp. 125-140. Zbl0525.90076MR643580
  2. 2. P. COURRIEU, A Distributed Search Algorithm for Hard Optimization. Technical Report TA9101, CREPCO, Université de Provence, 13621 Aix-en-Provence Cedex 1, 1991. Zbl0789.90073
  3. 3. P. COURRIEU, A convergent generator of neural networks, Technical Report TA9102, CREPCO, Université de Provence, 13621 Aix-en-Provence Cedex 1, 1991. 
  4. 4. T. CSENDES, A simple but hard-to-solve global optimization test problem. IIASA Workshop on Global Optimization, Sopron (Hungary), 1985. 
  5. 5. A. DEKKERS and E. AARTS, Global optimization and simulated annealing, Mathematical Programming, 50, 1991, pp. 367-393. Zbl0753.90060MR1114238
  6. 6. R. FLETCHER and C. M. REEVES, Function minimization by conjugate gradients, Computer J., 7, 1964, pp. 149-154. Zbl0132.11701MR187375
  7. 7. D. E. GOLDBERG, Genetic Algorithms in Search, Opitimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts, 1989. Zbl0721.68056
  8. 8. A. O. GRIEWANK, Generalized descent for global optimization, J. of Optimization Techniques and Application, 34, 1981, pp. 11-39. Zbl0431.49036MR626627
  9. 9. J. H. HOLLAND, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975. Zbl0317.68006MR441393
  10. 10. S. KIRKPATRICK, C. D. GELATT and M. P. VECCHI, optimization by simulated annealing, Science, 220, n° 4598, 1983, pp. 671-680. Zbl1225.90162MR702485
  11. 11. R. LENGELLÉ and T. DENOEUX, Optimizing Multilayer networks layer per layer without backpropagation, paper presented at ICANN'92, Brighton (U.K.), September 4-7, 1992. 
  12. 12. N. METROPOLIS, A. W. ROSENBLUTH, M. N. ROSENBLUTH and A. H. TELLER, Equations of state calculations by fast computing machines, J. Chem. Phys., 21, 1953, pp. 1087-1091. 
  13. 13. A. H. G. RINNOOY KAN and G. T. TIMMER, Stochastic global optimization methods. Part I: clustering methods, Mathematical Programming, 39, 1987, pp. 27-56. Zbl0634.90066MR909007
  14. 14. A. H. G. RINNOOY KAN and G. T. TIMMER, Stochastic global optimization methods. Part II: multi level methods, Mathematical Programming, 39, 1987, pp. 57-78. Zbl0634.90067MR909008
  15. 15. D. VANDERBILT and S. G. LOUIE, A Monte Carlo Simulated Annealing approach to optimization over continuous variables, J. of Computational Physics, 56, 1984, pp. 259-271. Zbl0551.65045MR768477
  16. 16. A. A. ZHIGLJAVSKY, Theory of Global Random Search, Kluwer Academic Publishers, Dordrecht, 1991. MR1187048

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.