Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2013, Special Issue (2013), Article ID 647524, 6 pages.

An Iterative Method with Norm Convergence for a Class of Generalized Equilibrium Problems

Haixia Zhang and Fenghui Wang

Full-text: Open access


Recently, Takahashi and Takahashi proposed an iterative algorithm for solving a problem for finding common solutions of generalized equilibrium problems governed by inverse strongly monotone mappings and of fixed point problems for nonexpansive mappings. In this paper, we provide a result that allows for the removal of one condition ensuring the strong convergence of the algorithm.

Article information

J. Appl. Math., Volume 2013, Special Issue (2013), Article ID 647524, 6 pages.

First available in Project Euclid: 14 March 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Zhang, Haixia; Wang, Fenghui. An Iterative Method with Norm Convergence for a Class of Generalized Equilibrium Problems. J. Appl. Math. 2013, Special Issue (2013), Article ID 647524, 6 pages. doi:10.1155/2013/647524.

Export citation


  • S. Takahashi and W. Takahashi, “Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space,” Nonlinear Analysis. Theory, Methods & Applications, vol. 69, no. 3, pp. 1025–1033, 2008.
  • K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory, vol. 28, Cambridge University Press, Cambridge, UK, 1990.
  • C. Byrne, “A unified treatment of some iterative algorithms in signal processing and image reconstruction,” Inverse Problems, vol. 20, no. 1, pp. 103–120, 2004.
  • P. L. Combettes, “Solving monotone inclusions via compositions of nonexpansive averaged operators,” Optimization, vol. 53, no. 5-6, pp. 475–504, 2004.
  • H.-K. Xu, “Averaged mappings and the gradient-projection algorithm,” Journal of Optimization Theory and Applications, vol. 150, no. 2, pp. 360–378, 2011.
  • E. Blum and W. Oettli, “From optimization and variational inequalities to equilibrium problems,” The Mathematics Student, vol. 63, no. 1–4, pp. 123–145, 1994.
  • S. D. Flåm and A. S. Antipin, “Equilibrium programming using proximal-like algorithms,” Mathematical Programming, vol. 78, no. 1, pp. 29–41, 1997.
  • H.-K. Xu, “Iterative algorithms for nonlinear operators,” Journal of the London Mathematical Society, vol. 66, no. 1, pp. 240–256, 2002.
  • P.-E. Maingé, “Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization,” Set-Valued Analysis, vol. 16, no. 7-8, pp. 899–912, 2008.
  • H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems, Springer, Dordrecht, The Netherlands, 1996.
  • J.-B. Baillon and G. Haddad, “Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones,” Israel Journal of Mathematics, vol. 26, no. 2, pp. 137–150, 1977.
  • F. Wang and H.-K. Xu, “Strongly convergent iterative algorithms for solving a class of variational inequalities,” Journal of Nonlinear and Convex Analysis, vol. 11, no. 3, pp. 407–421, 2010.