PROBABILISTIC SEARCH WITH OVERRIDES

被引:23
作者
Fox, Bennett L. [1 ]
Heine, George W. [1 ]
机构
[1] Univ Colorado, Dept Math, Denver, CO 80217 USA
关键词
Simulated annealing; optimization; loop-skipping; coupling; noisy objective function;
D O I
10.1214/aoap/1177004607
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Consider a time-inhomogeneous Markov chain which converges in probability to a subset S-0 of its state space. Override the standard move mechanism up to a random transition time, almost surely finite, but not necessarily a stopping time. Under weak conditions, the modified process converges in probability to the same set S-0. Two examples of independent interest illustrate this result.
引用
收藏
页码:1087 / 1094
页数:8
相关论文
共 17 条
[1]  
Asmussen S., 1987, APPL PROBABILITY QUE
[2]   CONVERGENCE THEOREMS FOR A CLASS OF SIMULATED ANNEALING ALGORITHMS ON R(D) [J].
BELISLE, CJP .
JOURNAL OF APPLIED PROBABILITY, 1992, 29 (04) :885-895
[4]  
CHIANG T.-S., 1988, SIAM J CONTROL OPTIM, V26, P1454
[5]   SIMULATED ANNEALING TYPE MARKOV-CHAINS AND THEIR ORDER BALANCE-EQUATIONS [J].
CONNORS, DP ;
KUMAR, PR .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1989, 27 (06) :1440-1461
[6]  
Fox B. L., 1993, Annals of Operations Research, V41, P47, DOI 10.1007/BF02022562
[7]  
Fox B. L, 1995, SIAG OPT VIEWS AND N, V7, P5
[8]  
Fox B. L, 1995, LECT NOTES STAT, V106, P17
[9]  
Fox B. L., 1995, LECT NOTES STAT, V106, P205
[10]   FASTER SIMULATED ANNEALING [J].
FOX, BL .
SIAM JOURNAL ON OPTIMIZATION, 1995, 5 (03) :488-505