Dinh, B.V. and Son, D.X. and Jiao, L. and Kim, D.S. (2016) Linesearch algorithms for split equilibrium problems and nonexpansive mappings. Fixed Point Theory and Applications, 2016 (1): 27. ISSN 16871820
Linesearch algorithms for split equilibrium problems and nonexpansive mappings.pdf
Download (1MB) | Preview
Abstract
In this paper, we first propose a weak convergence algorithm, called the linesearch algorithm, for solving a split equilibrium problem and nonexpansive mapping (SEPNM) in real Hilbert spaces, in which the first bifunction is pseudomonotone with respect to its solution set, the second bifunction is monotone, and fixed point mappings are nonexpansive. In this algorithm, we combine the extragradient method incorporated with the Armijo linesearch rule for solving equilibrium problems and the Mann method for finding a fixed point of an nonexpansive mapping. We then combine the proposed algorithm with hybrid cutting technique to get a strong convergence algorithm for SEPNM. Special cases of these algorithms are also given. © 2016, Dinh et al.
Item Type: | Article |
---|---|
Divisions: | Faculties > Faculty of Information Technology |
Identification Number: | 10.1186/s13663-016-0518-3 |
Additional Information: | Language of original document: English. All Open Access, Gold. |
URI: | http://eprints.lqdtu.edu.vn/id/eprint/9783 |