Adaptive parameterized improving hit-and-run for global optimization

References

• Ali , M. M. , Khompatraporn , C. and Zabinsky , Z. B. 2005 . A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems . J. Global Optim. , 31 : 635 – 672 .
   Web of Science ®Google Scholar
• Andradottir , S. 1999 . Accelerating the convergence of random search methods for discrete stochastic optimization . ACM Trans. Model. Comput. Simul. , 9 ( 4 ) : 349 – 380 .
   Google Scholar
• Andradottir , S. 2002 . Simulation optimization: Integrating research and practice . INFORMS J. Comput. , 14 ( 3 ) : 216 – 219 .
   Web of Science ®Google Scholar
• Anily , S. and Federgruen , A. 1987 . Simulated annealing methods with general acceptance probabilities . J. Appl. Probab. , 24 : 657 – 667 .
   Web of Science ®Google Scholar
• Belisle , C. J.P. 1992 . Convergence theorems for a class of simulated annealing algorithms on Rd . J. Appl. Probab. , 29 : 885 – 895 .
   Web of Science ®Google Scholar
• Belisle , C. J.P. , Romeijn , H. E. and Smith , R. L. 1993 . Hit-and-run algorithms for generating multivariate distributions . Math. Oper. Res. , 18 : 255 – 266 .
   Web of Science ®Google Scholar
• Bohachevsky , I. O. , Johnson , M. E. and Stein , M. L. 1986 . Generalized simulated annealing for function optimization . Technometrics, , 28 : 209 – 217 .
   Web of Science ®Google Scholar
• Brooks , D. G. and Verdini , W. A. 1988 . Computational experience with generalized simulated annealing over continuous variables . Am. J. Math. Manag. Sci. , 8 : 425 – 449 .
   Google Scholar
• Corana , A. , Marchesi , M. , Martini , C. and Ridella , S. 1987 . Minimizing multimodal functions of continuous variables with the simulated annealing algorithm . ACM Trans. Math. Software , 13 : 262 – 280 .
   Web of Science ®Google Scholar
• Famularo , D. , Sergeyev , Y. D. and Pugliese , P. 2006 . Test Problems for Lipschitz univariate global optimization with multiextremal constraints . Comput. Optim. Appl. , 34 ( 2 ) : 229 – 248 .
   Google Scholar
• Ghate , A. 2008 . Decentralized search on spheres using small world Markov chain: expected hitting times and structural properties . Adv. Appl. Probab. , 40 : 966 – 978 .
   Google Scholar
• Ghate , A. and Smith , R. L. 2008 . Adaptive search with stochastic acceptance probabilities for global optimization . Oper. Res. Lett. , 36 : 285 – 290 .
   Google Scholar
• Ghate , A. and Smith , R. L. 2008 . A hit-and-run approach for generating scale invariant small world networks . Networks, , 53 : 67 – 78 .
   Google Scholar
• Hanning , J. , Chong , E. K.P. and Kulkarni , S. 2006 . Relative frequencies of generalized simulated annealing . Math. Oper. Res. , 31 ( 1 ) : 199 – 216 .
   Google Scholar
• Johnson , A. W. and Jacobson , S. H. 2002 . A class of convergent generalized hill climbing algorithms . Appl. Math. Comput. , 125 ( 2–3 ) : 359 – 373 .
   Google Scholar
• Kalai , A. and Vempala , S. 2006 . Simulated annealing for convex optimization . Math. Oper. Res. , 31 ( 2 ) : 253 – 266 .
   Google Scholar
• Kaufman , D. E. and Smith , R. L. 1998 . Direction choice for accelerated convergence in hit-and-run sampling . Oper. Res. , 46 ( 1 ) : 84 – 95 .
   Google Scholar
• Kirkpatrick , S. , Gelatt , C. D. Jr. and Vecchi , M. P. 1983 . Optimization by simulated annealing . Science , 220 : 671 – 680 .
   PubMed Web of Science ®Google Scholar
• Locatelli , M. 1996 . Convergence properties of simulated annealing for continuous global optimization . J. Appl. Probab., , 33 : 1127 – 1140 .
   Web of Science ®Google Scholar
• Locatelli , M. 2000 . Simulated annealing algorithms for continuous global optimization: Convergence conditions . J. Optim. Theory Appl. , 104 : 121 – 133 .
   Web of Science ®Google Scholar
• Locatelli , M. 2000 . Simulated annealing algorithms for continuous global optimization . Available at di.unito.it/locatell/sa.ps
   Google Scholar
• Metropolis , N. , Rosenbluth , A. , Rosenbluth , M. , Teller , A. and Teller , E. 1953 . Equation of state calculations by fast computing machines . J. Chem. Phys. , 21 : 1087 – 1092 .
   Web of Science ®Google Scholar
• Mladineo , R. H. 1992 . “ Stochastic minimization of Lipschitz functions ” . In Recent Advances in Global Optimization , Edited by: Floudas , C. A. and Pardalos , P. M. 369 – 383 . Princeton, NJ : Princeton University Press .
   Google Scholar
• Romeijn , H. E. and Smith , R. L. 1994 . Simulated annealing for constrained global optimization . J. Global Optim. , 5 : 101 – 126 .
   Web of Science ®Google Scholar
• Romeijn , H. E. and Smith , R. L. 1994 . Simulated annealing and adaptive search in global optimization . Probab. Eng. Inf. Sci. , 8 : 571 – 590 .
   Google Scholar
• Shen , Y. , Kiatsupaibul , S. , Zabinsky , Z. B. and Smith , R. L. 2007 . An analytically derived cooling schedule for simulated annealing . J. Global Optim. , 38 : 333 – 365 .
   Web of Science ®Google Scholar
• Smith , R. L. 1984 . Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions . Oper. Res. , 32 : 1296 – 1308 .
   Web of Science ®Google Scholar
• Spall , J. C. 2003 . Introduction to Stochastic Search and Optimization: Estimation, Simulation and Control , Hoboken, New Jersey : Wiley .
   Google Scholar
• Szu , H. and Hartley , R. 1987 . Fast simulated annealing . Phy. Lett. A , 122 ( 3 & 4 ) : 157 – 162 .
   Google Scholar
• Tsallis , C. 1988 . Possible generalization of Boltzmann–Gibbs statistics . J. Stat. Phy. , 52 : 479
   Web of Science ®Google Scholar
• Tsitsiklis , J. N. 1989 . Markov chains with rare transitions and simulated annealing . Math. Oper. Res. , 14 ( 1 ) : 70 – 90 .
   Google Scholar
• Yang , R. L. 2000 . Convergence of the simulated annealing algorithm for continuous global optimization . J. Optim. Theory Appl. , 104 ( 3 ) : 691 – 716 .
   Google Scholar
• Zabinsky , Z. B. 2003 . Stochastic Adaptive Search for Global Optimization , Norwell, MA : Kluwer Academic Publishers .
   Google Scholar
• Zabinsky , Z. B. and Smith , R. L. 1992 . Pure adaptive search in global optimization . Math. Programming , 53 : 323 – 338 .
   Web of Science ®Google Scholar
• Zabinsky , Z. B. , Smith , R. L. , McDonald , J. F. , Romeijn , H. E. and Kaufman , D. E. 1993 . Improving hit-and-run for global optimization . J. Global Optimi. , 3 : 171 – 192 .
   Web of Science ®Google Scholar