Parallel Extragradient-Proximal Methods for Split Equilibrium Problems

In this paper, we introduce two parallel extragradient-proximal methods for solving split equilibrium problems. The algorithms combine the extragradient method, the proximal method and the shrinking projection method. The weak and strong convergence theorems for iterative sequences generated by the...

Full description

Saved in:
Bibliographic Details
Published inMathematical modelling and analysis Vol. 21; no. 4; pp. 478 - 501
Main Author Hieua, Dang Van
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.07.2016
Vilnius Gediminas Technical University
Subjects
Algorithms
Convergence
Convergence (Mathematics)
equilibrium problem
extragradient method
Functions (Mathematics)
Inequalities
Iterative methods
Mathematical models
Mathematical research
parallel algorithm
Projection
proximal method
Sequences
Sequences (Mathematics)
split equilibrium problem
Theorems
split equilibrium problem
proximal method
extragradient method
parallel algorithm
equilibrium problem
Online AccessGet full text

Cover

More Information
Summary:In this paper, we introduce two parallel extragradient-proximal methods for solving split equilibrium problems. The algorithms combine the extragradient method, the proximal method and the shrinking projection method. The weak and strong convergence theorems for iterative sequences generated by the algorithms are established under widely used assumptions for equilibrium bifunctions. We also present an application to split variational inequality problems and a numerical example to illustrate the convergence of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1392-6292
1648-3510
DOI:10.3846/13926292.2016.1183527