IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v183y2019i1d10.1007_s10957-019-01523-w.html
   My bibliography  Save this article

A Strong Convergence Theorem for a Parallel Iterative Method for Solving the Split Common Null Point Problem in Hilbert Spaces

Author

Listed:
  • Truong Minh Tuyen

    (Thai Nguyen University of Science)

  • Nguyen Thi Thu Thuy

    (Hanoi University of Science and Technology)

  • Nguyen Minh Trang

    (Thainguyen University of Technology)

Abstract

There are many iterative methods for solving the split common null point problems involving step sizes that depend on the norm of a bounded linear operator T. We know that the implementation of such algorithms is usually difficult to handle, because we have to compute the norm of the operator T. So, we propose new iterative methods involving a step size selected in such a way that its implementation does not require the computation or estimation of the norm of the operator T. In this paper, a new parallel iterative method for solving the split common null point problem is introduced in Hilbert spaces, without prior knowledge of operator norms. Moreover, some applications of our main results to the multiple-set split feasibility problem and the split minimum point problem are also presented.

Suggested Citation

  • Truong Minh Tuyen & Nguyen Thi Thu Thuy & Nguyen Minh Trang, 2019. "A Strong Convergence Theorem for a Parallel Iterative Method for Solving the Split Common Null Point Problem in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 271-291, October.
    • Handle: RePEc:spr:joptap:v:183:y:2019:i:1:d:10.1007_s10957-019-01523-w
    DOI: 10.1007/s10957-019-01523-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01523-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-019-01523-w?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.

    References listed on IDEAS

    as
    1. Boikanyo, Oganeditse A., 2015. "A strongly convergent algorithm for the split common fixed point problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 844-853.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wachirapong Jirakitpuwapat & Poom Kumam & Yeol Je Cho & Kanokwan Sitthithakerngkiet, 2019. "A General Algorithm for the Split Common Fixed Point Problem with Its Applications to Signal Processing," Mathematics, MDPI, vol. 7(3), pages 1-20, February.
    2. Nattakarn Kaewyong & Kanokwan Sitthithakerngkiet, 2022. "An Inertial Extragradient Direction Method with Self-Adaptive Step Size for Solving Split Minimization Problems and Its Applications to Compressed Sensing," Mathematics, MDPI, vol. 10(6), pages 1-25, March.
    3. Ismat Beg & Mujahid Abbas & Muhammad Waseem Asghar, 2023. "Approximation of the Solution of Split Equality Fixed Point Problem for Family of Multivalued Demicontractive Operators with Application," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    4. Nishu Gupta & Mihai Postolache & Ashish Nandal & Renu Chugh, 2021. "A Cyclic Iterative Algorithm for Multiple-Sets Split Common Fixed Point Problem of Demicontractive Mappings without Prior Knowledge of Operator Norm," Mathematics, MDPI, vol. 9(4), pages 1-19, February.

    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:spr:joptap:v:183:y:2019:i:1:d:10.1007_s10957-019-01523-w. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.