Skip to main content

Advertisement

Log in

Two-step methods and relaxed two-step methods for solving the split equality problem

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

The inverse problems as a classical mathematical model arise frequently in practical applications. While the split equality problem is an inverse problem arising frequently in signal processing, phase retrieval and medical image reconstruction etc. which is also an important extension of the split feasibility problem. In this paper, motivated and inspired by an idea for solving a variational inequality, we proved that several two-step methods and relaxed two-step methods can be applied to solve the split equality problem. What’s more, we proved that the technique of optimal step size for solving the variational inequality is still efficient for the split equality problem. Meanwhile, we also confirmed that these provided methods also apply to solving the split feasibility problem.

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

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Antipin AS (1976) On a method for convex programs using a symmetrical modification of the Lagrange function. Èkonom. i Mat. Metody 12:1164–1173

    Google Scholar 

  • Bauschke HH, Borwein JM (1996) On projection algorithms for solving convex feasibility problems. SIAM Rev 38:367–426

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Cai X, Gu G, He BS (2014) On the \(O(1/t)\) convergence rate of the projection and contaction methods for variational inequalities with Lipschitz continuous monotone operators. Comput Optim Appl 57:339–363

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Censor Y, Gibali A, Reich S (2011) The subgradient extragradient method for solving variational inequalities in Hilbert space. J Optim Theory Appl 148:318–335

    Article  MathSciNet  Google Scholar 

  • Ceng LC, Wong NC, Yao JC (2015) Hybrid extragradient methods for finding minimum-norm solutions of split feasibility problems. J Nonlinear Convex Anal 16:1965–1983

    MathSciNet  MATH  Google Scholar 

  • Charles L (2013) Byrne, abdellatif moudafi, extensions of the CQ algorithm for the split feasibility and split equality problems, documents de Travail 2013–01. Universit des Antilles et de la Guyane, CEREGMIA

    Google Scholar 

  • Dong QL, Lu YY, Yang J (2016) The extragradient algorithm with inertial effects for solving the variational inequality. Optim 65:2217–2226

    Article  MathSciNet  Google Scholar 

  • Fukushima M (1986) A relaxed projection method for variational inequalities. Math Program 35:58–70

    Article  MathSciNet  Google Scholar 

  • He BS (1997) A class of projection and contraction methods for monotone variational inequalities. Appl Math Optim 35:69–76

    Article  MathSciNet  Google Scholar 

  • Korpelevich GM (1976) The extragradient method for finding saddle points and other problems. Èkonom. i Mat. Metody 12:747–756

    MathSciNet  MATH  Google Scholar 

  • Shi LY, Chen RD, Wu YJ (2014) Strong convergence of iterative algorithms for the split equality problem. J Inequal Appl (Article ID 478)

  • Sun DF (1996) A class of iterative methods for solving nonlinear projection equations. J Optim Theory Appl 91:123–140

    Article  MathSciNet  Google Scholar 

  • Takahashi W (2014) The split feasibility problem in Banach spaces. J Nonlinear Convex Anal 15:1349–1355

    MathSciNet  MATH  Google Scholar 

  • Tian DL, Shi LY, Chen RD (2016) Iterative algorithm for solving the multiple-sets split equality problem with split self-adaptive step size in Hilbert spaces. J Inequal Appl 2016(Article ID 34)

  • Tian DL, Shi LY, Chen RD (2017) Strong convergence theorems for split inclusion problems in Hilbert spaces. J Fixed Point Theory Appl 19:1501–1514

    Article  MathSciNet  Google Scholar 

  • Tseng P (2000) A modified forward-backward splitting method for maximal monotone mappings. SIAM J Control Optim 38:431–446

    Article  MathSciNet  Google Scholar 

  • Wang F, Xu HK (2011) Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Amal 74:4105–4111

    Article  MathSciNet  Google Scholar 

  • Xu HK, Alghamdi MA, Shahzad N (2017) An unconstrained optimization approach to the split feasibility problem. J Nonlinear Convex Anal 18:1891–1899

    MathSciNet  MATH  Google Scholar 

  • Yao YH, Postolache M, Qin XL (2018) Iterative algorithms for the proximal split feasibility problem. U Politeh Buch Ser A 80(3):37–44

    MathSciNet  MATH  Google Scholar 

  • Zhao JL, Yang Q (2011) Self-adaptive projection methods for the multiple-sets split feasibility problem. Inverse Probl 27:035009

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The research was supported by NSFC Grants Nos. 11301379; 11871303.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dianlu Tian.

Ethics declarations

Conflicts of interest

The authors declare that they have no conflict of interest.

Additional information

Communicated by Antonio C.G.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tian, D., Jiang, L. Two-step methods and relaxed two-step methods for solving the split equality problem. Comp. Appl. Math. 40, 83 (2021). https://doi.org/10.1007/s40314-021-01465-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40314-021-01465-y

Keywords

Mathematics Subject Classification

Navigation