Advanced Search
MyIDEAS: Login

Abstract stochastic approximations and applications

Contents:

Author Info

  • Shwartz, Adam
  • Berman, Nadav
Registered author(s):

    Abstract

    Results on the convergence with probability one of stochastic approximation algorithms of the form [theta]n+1 = [theta]n - [gamma]n+1 h([theta]n) + un+1 are given, where the [theta]'s belong to some Banach space and {un} is a stochastic process. Using this extension of results of Kushner and Clark [10], conditions are given for the convergence of the linear algorithm . Several applications of the linear algorithm to problems of identification of (possibly distributed) systems and optimization are given. The applicability of these conditions is demonstrated via an example. The systems considered here are more general than those considered by Kushner and Shwartz [12].

    Download Info

    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.
    File URL: http://www.sciencedirect.com/science/article/B6V1B-45FKRNK-2J/2/c879463bb808e399d51161077da4224c
    Download Restriction: Full text for ScienceDirect subscribers only

    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.

    Bibliographic Info

    Article provided by Elsevier in its journal Stochastic Processes and their Applications.

    Volume (Year): 31 (1989)
    Issue (Month): 1 (March)
    Pages: 133-149

    as in new window
    Handle: RePEc:eee:spapps:v:31:y:1989:i:1:p:133-149

    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
    Web: https://shop.elsevier.com/OOC/InitController?id=505572&ref=505572_01_ooc_1&version=01

    Related research

    Keywords: stochastic approximation in Banach space strong convergence linear algorithms;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Chen, Xiaohong & White, Halbert, 2002. "Asymptotic Properties of Some Projection-based Robbins-Monro Procedures in a Hilbert Space," University of California at San Diego, Economics Working Paper Series qt4z4380t7, Department of Economics, UC San Diego.
    2. Chen, Xiaohong & White, Halbert, 1998. "Nonparametric Adaptive Learning with Feedback," Journal of Economic Theory, Elsevier, vol. 82(1), pages 190-222, September.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:31:y:1989:i:1:p:133-149. 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: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.