Strong Strong convergence algorithms for equilibrium problems without monotonicity

Authors

  • B. Dinh Department of Mathematics, Faculty of Information Technology,Le Quy Don Technical University, Hanoi, Vietnam
  • H. Thanh Department of Mathematics, Faculty of Information Technology,Le Quy Don Technical University, Hanoi, Vietnam
  • H. Ngoc Department of Scientific Fundamentals, Vietnam Trade Union University, Hanoi, Vietnam
  • T. Huyen Department of Mathematics, Faculty of Information Technology,Le Quy Don Technical University, Hanoi, Vietnam

Abstract

In this paper, we introduce two new line search algorithms for solving a non-monotone equilibrium problem in a real Hilbert space. Each method can be considered as a combination of the extragradient method with line search and shrinking projection methods. Then we show that the iterative sequence generated by each method converges strongly to a solution of the considered problem. A numerical example is also provided.

Downloads

Published

2018-12-31

How to Cite

Dinh, B., Thanh, H., Ngoc, H., & Huyen, T. (2018). Strong Strong convergence algorithms for equilibrium problems without monotonicity. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 9(2), 139-150. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/537

Issue

Section

Research Article