IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v166y2015i3d10.1007_s10957-014-0701-9.html
   My bibliography  Save this article

A Cyclic and Simultaneous Iterative Method for Solving the Multiple-Sets Split Feasibility Problem

Author

Listed:
  • Meng Wen

    (Xi’an Jiaotong University
    Beijing Center for Mathematics and Information Interdisciplinary Sciences)

  • Jigen Peng

    (Xi’an Jiaotong University
    Beijing Center for Mathematics and Information Interdisciplinary Sciences)

  • Yuchao Tang

    (NanChang University)

Abstract

The iterative projection methods for solving the multiple-sets split feasibility problem have been paid much attention in recent years. In this paper, we introduce a cyclic and simultaneous iterative sequence with self-adaptive step size for solving this problem. The advantage of the self-adaptive step size is that it does not need to know the Lipschitz constant of the gradient operator in advance. Furthermore, we propose a relaxed cyclic and simultaneous iterative sequence with self-adaptive step size, respectively. The theoretical convergence results are established in an infinite-dimensional Hilbert spaces setting. Preliminary numerical experiments show that these iteration methods are practical and easy to implement.

Suggested Citation

  • Meng Wen & Jigen Peng & Yuchao Tang, 2015. "A Cyclic and Simultaneous Iterative Method for Solving the Multiple-Sets Split Feasibility Problem," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 844-860, September.
    • Handle: RePEc:spr:joptap:v:166:y:2015:i:3:d:10.1007_s10957-014-0701-9
    DOI: 10.1007/s10957-014-0701-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-014-0701-9
    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-014-0701-9?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. H. H. Bauschke & S. G. Kruk, 2004. "Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone," Journal of Optimization Theory and Applications, Springer, vol. 120(3), pages 503-531, March.
    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. Jinhua Wang & Yaohua Hu & Carisa Kwok Wai Yu & Xiaojun Zhuang, 2019. "A Family of Projection Gradient Methods for Solving the Multiple-Sets Split Feasibility Problem," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 520-534, November.
    2. Q. L. Dong & Y. C. Tang & Y. J. Cho & Th. M. Rassias, 2018. "“Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem," Journal of Global Optimization, Springer, vol. 71(2), pages 341-360, June.

    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. Jinhua Wang & Yaohua Hu & Carisa Kwok Wai Yu & Xiaojun Zhuang, 2019. "A Family of Projection Gradient Methods for Solving the Multiple-Sets Split Feasibility Problem," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 520-534, November.
    2. Heinz H. Bauschke & Minh N. Dao & Dominikus Noll & Hung M. Phan, 2016. "On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces," Journal of Global Optimization, Springer, vol. 65(2), pages 329-349, June.
    3. Heinz H. Bauschke & Caifang Wang & Xianfu Wang & Jia Xu, 2015. "On the Finite Convergence of a Projected Cutter Method," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 901-916, June.
    4. Minh N. Dao, & Hung M. Phan, 2019. "Linear Convergence of Projection Algorithms," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 715-738, May.

    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:166:y:2015:i:3:d:10.1007_s10957-014-0701-9. 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.