Rates of Convergence for a Class of Global Stochastic Optimization Algorithms

Authors:
G. Yin
Affiliations:
-
Venue:
SIAM Journal on Optimization
Year:
1999

Citing 0
Cited 7

Stochastic optimization and the simultaneous perturbation method

Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Global random optimization by simultaneous perturbation stochastic approximation

Proceedings of the 33nd conference on Winter simulation
Convergence Rates of Digital Diffusion Network Algorithms for Global Optimization with Applications to Image Estimation

Journal of Global Optimization
Stochastic approximation with simulated annealing as an approach to global discrete-event simulation optimization

WSC '04 Proceedings of the 36th conference on Winter simulation
Sampling schedule design towards optimal drug monitoring for individualizing therapy

Computer Methods and Programs in Biomedicine
Geometry construction from caustic images

ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
A conditional gaussian martingale algorithm for global optimization

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired and motivated by the recent advances in simulated annealing algorithms, this paper analyzes the convergence rates of a class of recursive algorithms for global optimization via Monte Carlo methods. By using perturbed Liapunov function methods, stability results of the algorithms are established. Then the rates of convergence are ascertained by examining the asymptotic properties of suitably scaled estimation error sequences.