Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
In this paper the Robbins-Monro (RM) algorithm with step-size an = 1/n and truncated at randomly varying bounds is considered under mild conditions imposed on the regression function. It is proved that for its a.s. convergence to the zero of a regression function the necessary and sufficient condition is where [xi]i denotes the measurement error. It is also shown that the algorithm is robust with respect to the measurement error in the sense that the estimation error for the sought-for zero is bounded by a function g([var epsilon]) such that
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (1987)
Issue (Month): ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description|
|Order Information:|| Postal: http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:27:y:1987:i::p:217-231. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.