Skip to main content
Log in

On the convergence of CQ algorithm with variable steps for the split equality problem

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

We investigate CQ algorithm for the split equality problem in Hilbert spaces. In such an algorithm, the selection of the step requires prior information on the matrix norms, which is not always possible in practice. In this paper, we propose a new way to select the step so that the implementation of the algorithm does not need any prior information of the matrix norms. In Hilbert spaces, we establish the weak convergence of the proposed method to a solution of the problem under weaker conditions than usual. Preliminary numerical experiments show that the efficiency of the proposed algorithm when it applies the variable step-size.

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

Access this article

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. Boikanyo, O. A.: A strongly convergent algorithm for the split common fixed point problem. Appl. Math. Comput. 265, 844–853 (2015)

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Byrne, C., Moudafi, A.: Extensions of the CQ algorithm for the split feasibility and split equality problems, to appear in Journal of Nonlinear and Convex Analysis

  4. Cegielski, A.: General method for solving the split common fixed point problem. J. Optim. Theory Appl. 165, 385–404 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Censor, Y., Elfving, T.: A multiprojection algorithms using Bragman projection in a product space. J. Numer. Algorithms 8, 221–239 (1994)

    Article  MATH  Google Scholar 

  6. Combettes, P. L.: Quasi-Fejérian analysis of some optimization algorithms. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp 115–152. Elsevier, New York (2001)

  7. López, G., Martín, V., Wang, F., Xu, H.K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Problems 28, 085004 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Moudafi, A: A relaxed alternating CQ-algorithm for convex feasibility problems. Nonlinear Anal. 79, 117–121 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  9. Tan, K.K., Xu, H.K.: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process. J. Math. Anal. Appl. 178, 301–308 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Wang, F: A splitting-relaxed projection method for solving the split feasibility problem. Fixed Point Theory 14, 211–218 (2013)

    MathSciNet  MATH  Google Scholar 

  11. Wang, F., Xu, H.K., Su, M.: Choices of variable steps of the CQ algorithm for the split feasibility problem. Fixed Point Theory 12, 489–496 (2011)

    MathSciNet  MATH  Google Scholar 

  12. Xu, H.K: A variable Krasnosel’skii-Mann algorithm and the multiple-set split feasibility problem. Inverse Problems 22, 2021–2034 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Xu, H.K.: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Problems 26, 105018 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Yang, Q: On variable-step relaxed projection algorithm for variational inequalities. J. Math. Anal. Appl. 302, 166–179 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fenghui Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, F. On the convergence of CQ algorithm with variable steps for the split equality problem. Numer Algor 74, 927–935 (2017). https://doi.org/10.1007/s11075-016-0177-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-016-0177-9

Keywords

Mathematics Subject Classifications (2010)

Navigation