Strong Strong convergence algorithms for equilibrium problems without monotonicity
http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/537Publisher, magazine: ,
Publication year: 2018
Lưu Trích dẫn Chia sẻ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.
Tags: Non-monotonicity; equilibria; shrinking projection methods; strong con-vergence; Armijo linesearch; Hilbert space
Các bài viết liên quan đến tác giả Bùi Văn Định
On Penalty and gap function methods for bilevel pseudomonotone equilibrium problems
Algorithms for a class of bilevel programs involving pseudomonotone variational inequalities
Bilevel optimization as a regularization approach to pseudomonotone equilibrium problems
A note on the combination of equilibrium problems
Extragradient-Proximal Methods for Split Equilibrium and Fixed Point Problems in Hilbert Spaces
An inertial extragradient method for solving bilevel equilibrium problems
Strong Strong convergence algorithms for equilibrium problems without monotonicity
Extragradient subgradient methods for solving bilevel equilibrium problems