IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i2p145-d203308.html
   My bibliography  Save this article

An Iterative Approach to the Solutions of Proximal Split Feasibility Problems

Author

Listed:
  • Li-Jun Zhu

    (The Key Laboratory of Intelligent Information and Data Processing of NingXia Province, North Minzu University, Yinchuan 750021, China
    Health Big Data Research Institute of North Minzu University, Yinchuan 750021, China)

  • Yonghong Yao

    (School of Mathematical Sciences, Tianjin Polytechnic University, Tianjin 300387, China)

Abstract

The proximal split feasibility problem is investigated in Hilbert spaces. An iterative procedure is introduced for finding the solution of the proximal split feasibility problem. Strong convergence analysis of the presented algorithm is proved.

Suggested Citation

  • Li-Jun Zhu & Yonghong Yao, 2019. "An Iterative Approach to the Solutions of Proximal Split Feasibility Problems," Mathematics, MDPI, vol. 7(2), pages 1-9, February.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:2:p:145-:d:203308
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/2/145/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/2/145/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    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.
    2. Yonghong Yao & Wu Jigang & Yeong-Cheng Liou, 2012. "Regularized Methods for the Split Feasibility Problem," Abstract and Applied Analysis, Hindawi, vol. 2012, pages 1-13, February.
    3. Jason Xu & Eric C. Chi & Meng Yang & Kenneth Lange, 2018. "A majorization–minimization algorithm for split feasibility problems," Computational Optimization and Applications, Springer, vol. 71(3), pages 795-828, December.
    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. Qiao-Li Dong & Songnian He & Michael Th. Rassias, 2021. "General splitting methods with linearization for the split feasibility problem," Journal of Global Optimization, Springer, vol. 79(4), pages 813-836, April.
    2. Yan-Juan He & Li-Jun Zhu & Nan-Nan Tan, 2021. "An Improved Alternating CQ Algorithm for Solving Split Equality Problems," Mathematics, MDPI, vol. 9(24), pages 1-10, December.
    3. Wu, Runxiong & Chen, Xin, 2021. "MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection," Computational Statistics & Data Analysis, Elsevier, vol. 155(C).
    4. Chen Chen & Ting Kei Pong & Lulin Tan & Liaoyuan Zeng, 2020. "A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection," Journal of Global Optimization, Springer, vol. 78(1), pages 107-136, September.

    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:gam:jmathe:v:7:y:2019:i:2:p:145-:d:203308. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.