By Topic

An Analysis of Cut-Off Rules for Optimization Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Greenberg, Harvey J. ; Computer Science/Operations Research Center, Southern Methodist University, Dallas, Tex. 75275. ; Loh, Lawruence W.T.

The problem of optimal stopping has long bee of intrest to various scientific disciplines. Most notably, the approacbes taken have been based on sequential decision theory and modeling techniqes. Aiming at optimization algorithms, we propose in this paper to combine the present approaches and study the cut-off rule problem, using asymptotic convergence behavior of sequences. A unifying framework for the design and analysis of stopping rules for algorithms generating a monotonically convergent sequence is presented while methodology for optimal design is discussed. The concavity structure should be observed to play an important role in our analysis.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-4 ,  Issue: 1 )