Bounds on absorption times of directionally biased random sequences

Random Structures and Algorithms

Volumn 9, Issue 3, 1996, Pages 279-293

  Baritompa, Bill ^a   Steel, Mike ^a  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Convergence rates; Finite state stochastic process; Markov chains; Simulated annealing; Stochastic optimization

Indexed keywords

EID: 0030509273     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199610)9:3<279::AID-RSA2>3.0.CO;2-U     Document Type: Article

References (16)

1. S. Antily and A. Federgruen, Simulated annealing methods with general acceptance probabilities, J. Appl. Probab. 24, 657-667 (1987).
2. B.A. Berg, Locating global minima in optimization problems by a random-cost approach, Nature, 361, 708-710 (1993).
3. G. Dueck and T. Scheuer, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. 90, 161-175 (1990).
4. E.B. Dynkin and A. A. Yushkevich, Markov Processes-Theorems and Problems, Plenum, New York, 1969.
5. U. Faigle and W. Kern, Note on the convergence of simulated annealing algorithms, SIAM J. Control Optim. 29, 153-159 (1991).
6. U. Faigle and W. Kern, Some convergence results for probabilistic tabu search, ORSA J. Comput., 4(1), 33-37 (1992).
7. A. Ferreira and J. Zerovnik, Bounding the probability of success of stochastic methods for global optimization, Comput. Math. Appl. 25, 1-8 (1993).
8. N. L. Johnson, and S. Kotz, Encylopedia of Statistical Sciences, Wiley, New York, 1988.
9. G. R. Kelly, Three optimization problems in mathematical statistics, Master Thesis, University of Canterbury, 1980.
10. J. G. Kemeny and J. L. Snell, Finite Markov Chains, Springer-Verlag, New York, 1983.
11. M. Lundy and A. Mees, Convergence of the annealing algorithm, Math. Prog., 34, 111-124 (1986).
12. A.S. Manne, Linear programming and sequential decisions, Manage. Sci., 6(3), 259-267 (1960).
13. S.M. Ross, Applied Probability Models with Optimization Applications, Holdon-Day, 1970.
14. R. Smith and Z. Zabinsky, Pure adaptive search in global optimization, Math. Prog., 53, 323-338 (1992).
15. F. J. Solis and R. J. B. Wets, Minimization by random search techniques, Math. Op. Res. 6(1), 19-30 (1981).
16. Z. Zabinsky, G. R. Wood, M. Steel, and W. Baritompa, Pure adaptive search for Finite global optimization, Math Prog., 69(3), 443-448 (1995).