1992
DOI: 10.1109/9.119632
|View full text |Cite
|
Sign up to set email alerts
|

Multivariate stochastic approximation using a simultaneous perturbation gradient approximation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

8
1,410
0

Year Published

1999
1999
2011
2011

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 1,845 publications
(1,418 citation statements)
references
References 24 publications
8
1,410
0
Order By: Relevance
“…We will not present the formal conditions for convergence and asymptotic normality of SPSA, as such conditions are available in many references (e.g., Dippon and Renz, 1997;Gerencsér, 1999;Spall, 1992. These conditions are essentially identical to the standard conditions for convergence of SA algorithms, with the exception of the additional conditions on the user-generated perturbation vector ∆ k .…”
Section: Copyright Springer Heidelberg 2004mentioning
confidence: 99%
See 1 more Smart Citation
“…We will not present the formal conditions for convergence and asymptotic normality of SPSA, as such conditions are available in many references (e.g., Dippon and Renz, 1997;Gerencsér, 1999;Spall, 1992. These conditions are essentially identical to the standard conditions for convergence of SA algorithms, with the exception of the additional conditions on the user-generated perturbation vector ∆ k .…”
Section: Copyright Springer Heidelberg 2004mentioning
confidence: 99%
“…Under reasonably general conditions (see Spall, 1992, or Spall, 2003, the SPSA and FDSA algorithms achieve the same level of statistical accuracy for a given number of iterations even though SPSA uses only 1|p times the number of function evaluations of FDSA (since each gradient approximation uses only 1|p the number of function evaluations).…”
Section: Copyright Springer Heidelberg 2004mentioning
confidence: 99%
“…The proposed method (SASP) is obtained by hybridization of the two methods, the simulated annealing algorithm [4] and the descent method where the gradient [6] is estimate by using the simultaneous perturbation.…”
Section: The Sasp Methodsmentioning
confidence: 99%
“…FD requires 2N measurements, which is usually not very efficient. The SP method, as introduced by Spall (1987) and more fully analyzed in Spall (1992), overcomes this drawback. The essential feature of SP is its underlying gradient approximation that requires only two measurements per iteration independent of the dimension N .…”
Section: General Experiments Settingsmentioning
confidence: 99%