Stochastic global optimization methods part II: Multi level methods

• J.L. Bentley, B.W. Weide and A.C. Yao, “Optimal expected-time algorithms for closest point problems,”ACM Transactions on Mathematical Software 6 (1980) 563–580.

  Article  MATH  MathSciNet  Google Scholar 

• C.G.E. Boender and A.H.G. Rinnooy Kan, “Bayesian stopping rules for a class of stochastic global optimization methods,” Technical Report, Econometric Institute, Erasmus University Rotterdam (1985).

• F.H. Branin and S.K. Hoo, “A method for finding multiple extrema of a function ofn variables,” in: F.A. Lootsma, ed.,Numerical Methods of Nonlinear Optimization (Academic Press, London, 1972) pp. 231–237.

  Google Scholar 

• H. Bremmerman, “A method of unconstrained global optimization,”Mathematical Biosciences 9 (1970) 1–15.

  Article  MathSciNet  Google Scholar 

• L. De Biase and F. Frontini, “A stochastic method for global optimization: its structure and numerical performance” (1978), in: Dixon and Szegö (1978a) pp. 85–102.

• L.C.W. Dixon, J. Gomulka and S.E. Hersom, “Reflections on the global optimization problem,” in: L.C.W. Dixon, ed.,Optimization in Action (Academic Press, London 1976) 398–435.

  Google Scholar 

• L.C.W. Dixon and G.P. Szegö (eds.),Towards Global Optimization 2 (North-Holland, Amsterdam, 1978a).

  Google Scholar 

• L.C.W. Dixon and G.P. Szegö, “The global optimization problem” (1978b) in: Dixon and Szegö (1978a) pp. 1–15.

• A. O. Griewank, “Generalized descent for global optimization,”Journal of Optimization Techniques and Application 34 (1981) 11–39.

  Article  MATH  MathSciNet  Google Scholar 

• J.T. Postmus, A.H.G. Rinnooy Kan and G.T. Timmer, “An efficient dynamic selection method,”Communications of the ACM 26 (1983) 878–881.

  Article  MathSciNet  Google Scholar 

• W.L. Price, “A controlled random search procedure for global optimization” (1978), in: Dixon and Szegö (1978a) pp. 71–84.

• A.H.G. Rinnooy Kan and G.T. Timmer, “Stochastics Methods for global optimization,”American Journal of Mathematical and Management Sciences 4 (1984) 7–40.

  MATH  MathSciNet  Google Scholar 

• A.H.G. Rinnooy Kan and G.T. Timmer, “Stochastic global optimization methods. Part I: clustering methods,”Mathematical Programming 38 (1987) 27–56 (this issue).

  MathSciNet  Google Scholar 

• J.A. Snijman and L.P. Fatti, “A multistart global minimization algorithm with dynamic search trajectories,” Technical Report, University of Pretoria (Republic of South Africa, 1985).

  Google Scholar 

• R.E. Tarjan,Data Structures and Network Algorithms, Siam CBNS/NSF Regional Conference Series in Applied Mathematics (1983).

• A.A. Törn, “Cluster analysis using seed points and density determined hyperspheres with an application to global optimization,” in:Proceeding of the Third International Conference on Pattern Recognition, Coronado, California (1976).

• A.A. Törn, “A search clustering approach to global optimization” (1978), in: Dixon and Szegö (1978a) pp. 49–62.

Download references