IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v262y2015icp218-223.html
   My bibliography  Save this article

On the computation of the step-size for the CQ-like algorithms for the split feasibility problem

Author

Listed:
  • Qu, Biao
  • Liu, Binghua
  • Zheng, Na

Abstract

In the CQ-like algorithms for the split feasibility problem, in order to get the step-size, one has to compute the largest eigenvalue of the related matrix or use some line search scheme. Our contribution in this short note is to give a simple CQ-like algorithm in which the step-size is directly computed. The algorithm presented in this paper not only need not to compute the largest eigenvalue of the related matrix but also need not to use any line search scheme. The theoretical convergence and numerical results are also given.

Suggested Citation

  • Qu, Biao & Liu, Binghua & Zheng, Na, 2015. "On the computation of the step-size for the CQ-like algorithms for the split feasibility problem," Applied Mathematics and Computation, Elsevier, vol. 262(C), pages 218-223.
  • Handle: RePEc:eee:apmaco:v:262:y:2015:i:c:p:218-223
    DOI: 10.1016/j.amc.2015.04.056
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315005147
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2015.04.056?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. Charles L. Byrne and Abdellatif Moudafi, 2013. "Extensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems," Documents de Travail 2013-01, CEREGMIA, Université des Antilles et de la Guyane.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Biao Qu & Changyu Wang & Naihua Xiu, 2017. "Analysis on Newton projection method for the split feasibility problem," Computational Optimization and Applications, Springer, vol. 67(1), pages 175-199, May.

    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. Suthep Suantai & Suparat Kesornprom & Watcharaporn Cholamjiak & Prasit Cholamjiak, 2022. "Modified Projection Method with Inertial Technique and Hybrid Stepsize for the Split Feasibility Problem," Mathematics, MDPI, vol. 10(6), pages 1-12, March.
    2. 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.

    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:eee:apmaco:v:262:y:2015:i:c:p:218-223. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.