IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n347401.html

On Two Projection Algorithms for the Multiple‐Sets Split Feasibility Problem

Author

Listed:
  • Qiao-Li Dong
  • Songnian He

Abstract

We present a projection algorithm which modifies the method proposed by Censor and Elfving (1994) and also introduce a self‐adaptive algorithm for the multiple‐sets split feasibility problem (MSFP). The global rates of convergence are firstly investigated and the sequences generated by two algorithms are proved to converge to a solution of the MSFP. The efficiency of the proposed algorithms is illustrated by some numerical tests.

Suggested Citation

  • Qiao-Li Dong & Songnian He, 2013. "On Two Projection Algorithms for the Multiple‐Sets Split Feasibility Problem," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:347401
    DOI: 10.1155/2013/347401
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/347401
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/347401?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
    ---><---

    References listed on IDEAS

    as
    1. Songnian He & Wenlong Zhu, 2012. "A Note on Approximating Curve with 1-Norm Regularization Method for the Split Feasibility Problem," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-10, July.
    2. Songnian He & Wenlong Zhu, 2012. "A Note on Approximating Curve with 1‐Norm Regularization Method for the Split Feasibility Problem," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    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.

      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:wly:jnljam:v:2013:y:2013:i:1:n:347401. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

      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.