IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i12p4329-4343.html
   My bibliography  Save this article

Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space

Author

Listed:
  • Akaninyene Udo Udom
  • Chijioke Joel Nweke

Abstract

Real life problems are entrenched in ambiguities. To deal with these ambiguities, stochastic functional analysis has emerged as one of the mathematical tools for solving these kinds of problems. The purpose of this paper is to extend the convergence results of deterministic convex feasibility problems to a stochastic convex feasibility problem and prove that the solution of a convex feasibility problem generated by random Mann-type and Simultaneous projection iterative algorithms with firmly non-expansive mapping converge in quadratic mean and consequently in probability to random fixed point in Hilbert space. These results extend, unify, and generalize different established deterministic results in the literature.

Suggested Citation

  • Akaninyene Udo Udom & Chijioke Joel Nweke, 2023. "Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(12), pages 4329-4343, June.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:12:p:4329-4343
    DOI: 10.1080/03610926.2021.1990956
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1990956
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1990956?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:52:y:2023:i:12:p:4329-4343. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.