Skip to main content
SpringerLink
Log in

Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

This paper deals with a bi-extrapolated subgradient projection algorithm by introducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to improve the convergence. And its convergence is proved under some suitable conditions. Numerical results illustrate that the bi-extrapolated subgradient projection algorithm converges more quickly than the existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C Byrne. Iterative oblique projection onto convex sets and the split feasibility problem, Inverse Problems, 2002, 18: 441–453.

    Article  MathSciNet  MATH  Google Scholar 

  2. H H Bauschke, M B Jonathan. On projecction algorithms for solving convex feasibility problems, SIAM Rev, 1996, 38, 367–426.

    Article  MathSciNet  MATH  Google Scholar 

  3. H H Bauschke, P L Combettes. Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer-Verlag, New York, 2011.

    Book  MATH  Google Scholar 

  4. Y Censor, T Elfving. A multiprojection algorithm using Bregman projections in a product space, Numer Algorithms, 1994, 8: 221–239.

    Article  MathSciNet  MATH  Google Scholar 

  5. Y Censor, T Elfving Kopf, T Bortfeld. The multiple-sets split feasibility problem and its applications for inverse problems, Inverse Problems, 2005, 21: 2071–2084.

    Article  MathSciNet  MATH  Google Scholar 

  6. Y Censor, D Bortfel, B Martin, A Trofimov. A unified approach for inversion problems in intensity-modulated radiation therapy, Physics Medicine Biology, 2006, 51: 2353–2365.

    Article  Google Scholar 

  7. Y Censor, A Motova, A Segal. Perturbed projections and subgradient projections for the multiplesets split feasibility problem, J Math Anal Appl, 2007, 327: 1244–1256.

    Article  MathSciNet  MATH  Google Scholar 

  8. Y Censor, S Alexander. On string-averaging for sparse problems and on the split common fixed point problem, Contemp Math, 2010, 513: 125–142.

    Article  Google Scholar 

  9. Y Censor, S Alexander. The split common fixed point problem for directed operators, J Convex Anal, 2009, 16: 587–600.

    MathSciNet  MATH  Google Scholar 

  10. Y Dang, Y Gao. The strong convergence of a KM-CQ-like algorithm for split feasibility problem, Inverse Problems, 2011, 27, 015007.

  11. Y Gao. Nonsmooth Optimization (in Chinese), Science Press, Beijing, 2008.

    Google Scholar 

  12. E Masad, S Reich. A note on the multiple-set split convex feasibility problem in Hilbert space, J Nonlinear Convex Anal, 2007, 8: 367–371.

    MathSciNet  MATH  Google Scholar 

  13. G Pierra. Eclatement de contraintes en parall’ele pour la minimisation dune forme quadratique, In: Lecture Notes in Computer Science, Springer-Verlag, New York, 1976, 41: 200C218.

    Google Scholar 

  14. G Pierra. Decomposition through formalization in a product space, Math Program, 1984, 28: 96–115.

    Article  MathSciNet  MATH  Google Scholar 

  15. R T Rocafellar. Convex Analysis, Princeton University Press, Princeton, 1971.

    Google Scholar 

  16. H Xu. A variable Krasnosel slii-Mann algorithm and the multiple-set split feasibility problem, Inverse Problems, 2006, 22: 2021–2034.

    Article  MathSciNet  MATH  Google Scholar 

  17. Q Yang. The relaxed CQ algorithm solving the split feasibility problem, Inverse Problems, 2004, 20: 1261–1266.

    Article  MathSciNet  MATH  Google Scholar 

  18. W Zhang, D Han, Z Li. A self-adaptive projection method for solving the multiple-sets split feasibility problem, Inverse Problems, 2009, 25, 115001.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology (Software College), Henan Polytechnic University, Henan, 454003, China

    Ya-zheng Dang

  2. School of Management, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Ya-zheng Dang & Yan Gao

Authors
  1. Ya-zheng Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ya-zheng Dang.

Additional information

Supported by Natural Science Foundation of Shanghai (14ZR1429200), National Science Foundation of China (11171221), Shanghai Leading Academic Discipline Project (XTKX2012), Innovation Program of Shanghai Municipal Education Commission (14YZ094), Doctoral Program Foundation of Institutions of Higher Education of China (20123120110004), Doctoral Starting Projection of the University of Shanghai for Science and Technology (ID-10-303-002), and Young Teacher Training Projection Program of Shanghai for Science and Technology.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dang, Yz., Gao, Y. Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem. Appl. Math. J. Chin. Univ. 29, 283–294 (2014). https://doi.org/10.1007/s11766-014-3070-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-014-3070-0

MR Subject Classification

Keywords

Search

Navigation