Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The stochastic root-finding problem: overview, solutions, and open questions
Pasupathy R., Kim S. ACM Transactions on Modeling and Computer Simulation21 (3):1-23,2011.Type:Article
Date Reviewed: May 27 2011

Both application- and theory-oriented scientists are familiar with the root-finding problem. The scientific literature is not only rich in original proposals and tutorials, but also in excellent books--Pasupathy and Kim mention some of them. This valuable overview of the stochastic root-finding problem consists of six sections and an electronic appendix (http://portal.acm.org/citation.cfm?doid=1921598.1921603).

After a short introduction (Section 1), Section 2 offers some examples that motivate the request for efficient root-finding procedures in a stochastic framework, including stochastic optimization problem solving.

Section 3 presents notations and terminology. In Section 4, the authors formulate the stochastic root-finding problem. Section 5 describes methods for solving the problem, giving only stochastic approximation and sample-path methods in detail, including basic convergence theorems, results on convergence rates and sample size, algorithms, implementation details, and comments on their performance. The online appendix describes a third type: parametric/semi-parametric methods. Contributions from many researchers, as well as recent developments by Pasupathy, represent the core of this section. Finally, in Section 6, readers will discover some ideas for future research. (The electronic appendix also includes in-depth discussions on research.)

Readers who are unfamiliar with the stochastic root-finding problem should pay attention to some abbreviations (SPSA and SOP) that the paper uses without explanation, an error in relation (7), and the use of the SP abbreviation in two different contexts (in Sections 5.1 and 5.2).

The references are adequate--many of them are on recent developments that can increase the performance of the existing algorithms. Unfortunately, the paper neglects to cite ten references and the introduction does not clearly state the structure of the online appendix.

This paper is a valuable resource for online readers. It will be especially useful to PhD students and various researchers in modeling and computer simulation.

Reviewer:  G. Albeanu Review #: CR139092 (1110-1068)
Bookmark and Share
  Featured Reviewer  
 
Iterative Methods (G.1.5 ... )
 
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
 
Simulation Theory (I.6.1 )
 
 
Probability And Statistics (G.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Iterative Methods": Date
Computational implementation of the multivariate Halley method for solving nonlinear systems of equations
Cuyt A., Rall L. ACM Transactions on Mathematical Software 11(1): 20-36, 1985. Type: Article
Aug 1 1985
Splitting iteration method for simple singular points and simple bifurcation points
Zhen M. Computing 41(1-2): 87-96, 1989. Type: Article
Oct 1 1989
A class of componentwise Krawczyk-Moore type iteration methods
Zuhe S. Computing 41(1-2): 149-152, 1989. Type: Article
May 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy