Probabilistic and Randomized Methods for Design Under Uncertainty
DOI: 10.1007/1-84628-095-8_3
|View full text |Cite
|
Sign up to set email alerts
|

Theoretical Framework for Comparing Several Stochastic Optimization Approaches

Abstract: In this chapter, we establish a framework for formal comparisons of several leading optimization algorithms, providing guidance to practitioners for when to use or not use a particular method. The focus in this chapter is five general algorithm forms: random search, simultaneous perturbation stochastic approximation, simulated annealing, evolution strategies, and genetic algorithms. We summarize the available theoretical results on rates of convergence for the five algorithm forms and then use the theoretical … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(23 citation statements)
references
References 25 publications
0
23
0
Order By: Relevance
“…The approach developed in our model is based on stochastic optimization (Spall et al 2006) with application to variable rainfall measurement errors and relevant evacuation thresholds, which has barely been applied to landslide problems so far. In landslide research, it is therefore rather uncommon to link measured environmental parameters such as rainfall with landslide consequences and damage in one integrated model.…”
Section: Discussion and Implications For Landslide Ewsmentioning
confidence: 99%
“…The approach developed in our model is based on stochastic optimization (Spall et al 2006) with application to variable rainfall measurement errors and relevant evacuation thresholds, which has barely been applied to landslide problems so far. In landslide research, it is therefore rather uncommon to link measured environmental parameters such as rainfall with landslide consequences and damage in one integrated model.…”
Section: Discussion and Implications For Landslide Ewsmentioning
confidence: 99%
“…. , kp = { ki } i=1: p from a distribution with bounded inverse expectation [11,19,23] (for example, a Bernoulli random number) in the search space at each iteration and (2) finding an ascent direction (using an approximate gradient estimate) by computing a two-sided simultaneous perturbation using the selected random direction. Given the random choice of direction k , it is natural to expect that a step in the selected direction does not necessarily result in an improvement of the objective function; meaningful computational saving over the finite-difference perturbation would only be achieved if very few random directions (relative to number of decision variables) are needed to yield marked improvements in the objective function.…”
Section: Objective Functionmentioning
confidence: 99%
“…In [16], a coordinate descent approach was developed for large-scale optimization with SPSA algorithm. The SPSA algorithm has also been compared with other stochastic search methods [23]. An important result is that [19,22,23] for a pdimensional problem under reasonably general conditions, the SPSA algorithm reaches the same level of accuracy as the finite-difference stochastic approximation method for a given number of iterations; however, SPSA uses p times fewer function evaluations at each iteration.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Simultaneous Perturbation Stochastic Approximation (SPSA) is an attractive choice for the optimiser: it is capable of evading local minima due to its stochastic nature and, when adapted for our framework, is orders of magnitude more efficient [13] than the traditional stochastic algorithms. Moreover, while in traditional gradient-based methods the number of function evaluations required to estimate the gradient at a point grows linearly with the dimensionality of the space, SPSA offers independence of the number of function evaluations at each iteration on the dimensionality of the space.…”
Section: Stochastic Optimisationmentioning
confidence: 99%