Stationary probability density of stochastic search processes in globaloptimization

Journal of Statistical Mechanics: Theory and Experiment

Volumn 2008, Issue 1, 2008, Pages

  Berrones, Arturo ^a  

^a UNIVERSIDAD AUTÓNOMA DE NUEVO LEÓN   (Mexico)

Author keywords

Heuristics; Stochastic search

Indexed keywords

EID: 38949125956     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2008/01/P01013     Document Type: Article

References (26)

1. Kirkpatrick S, Gelatt C D Jr and Vecchi M P 1983 Optimization by simulated annealing Science 220 671
2. Gidas B 1995 Topics in Contemporary Probability and its Applications (Prob. Stochastic Ser.) (Boca Raton, FL: CRC) pp159-232
3. Parpas P, Rustem B and Pistikopoulos E N 2006 Linearly constrained global optimization and stochastic differential equations J. Global Optim. 36 191
4. Geman S and Hwang C R 1986 Diffusions for global optimization SIAM J. Control Optim. 24 1031
5. Goldberg D 1989 Genetic Algorithms in Search, Optimization and Machine Learning (Reading, MA: Addison-Wesley)
6. Eiben A E and Smith J E 2003 Introduction to Evolutionary Computing (Berlin: Springer)
7. Pelikan M, Goldberg D E and Lobo F G 2002 A survey of optimization by building and using probabilistic models Comput. Optim. Appl. 21 5
8. Floudas C A 2000 Deterministic Global Optimization: Theory, Methods and Applications (Dordrecht: Kluwer)
9. Horst R, Pardalos P M and Thoai N V 1995 Introduction to Global Optimization (Dordrecht: Kluwer) pp158-83
10. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A and Teller E 1953 Equations of state calculations by fast computing machines J. Chem. Phys. 21 1087
11. Suykens J A K, Verrelst H and Vandewalle J 1998 On-line learning Fokker-Planck machine Neural Process. Lett. 7 81
12. Risken H 1984 The Fokker-Planck Equation (Berlin: Springer)
13. Van Kampen N G 1992 Stochastic Processes in Physics and Chemistry (Amsterdam: North-Holland)
14. Grasman J and van Herwaarden O A 1999 Asymptotic Methods for the Fokker-Planck Equation and the Exit Problem in Applications (Berlin: Springer)
15. Geman S and Geman D 1984 Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images IEEE Trans. Pattern Anal. Mach. Intell. 6 721
16. Devroye L 1986 Non-Uniform Random Variate Generation (Berlin: Springer)
17. Berrones A 2007 IWANN 2007: Proc. of the 9th Int. Work-Conf. on Artificial Neural Networks (Springer Lecture Notes in Computer Science vol 4507) (Berlin: Springer) pp1-8
18. Press W, Teukolsky S, Vetterling W and Flannery B 2005 Numerical Recipes in C++, the Art of Scientific Computing (Cambridge: Cambridge University Press)
19. Parsopoulos K E and Vrahatis M N 2002 Recent approaches to global optimization problems through particle swarm optimization Nat. Comput. 1 235
20. Roberts G O and Polson N G 1994 On the geometric convergence of the Gibbs sampler J. R. Stat. Soc. B 56 377
21. Canty A 1999 Hypothesis tests of convergence in Markov chain Monte Carlo J. Comput. Graphical Stat. 8 93
22. Laguna M and Martí R 2005 Experimental testing of advanced scatter search designs for global optimization of multimodal functions J. Global Optim. 33 235
23. Pisinger D 2005 Where are the hard knapsack problems? Comput. Oper. Res. 32 2271
24. http://www.gnu.org/software/glpk/
25. Nelder J A and Mead R 1965 A simplex method for function minimization Comput. J. 7 308
26. Hu J, Fu M and Marcus S 2007 A model reference adaptive search method for global optimization Oper. Res. 55 549