Contraction-mapping algorithm for the equilibrium problem over the fixed point set of a nonexpansive semigroup

In this paper, we consider the proximal mapping of a bifunction. Under the Lipschitz-type and the strong monotonicity conditions, we prove that the proximal mapping is contractive. Based on this result, we construct an iterative process for solving the equilibrium problem over the fixed point sets o...

Full description

Saved in:
Bibliographic Details
Published inMathematical modelling and analysis Vol. 24; no. 1; pp. 43 - 61
Main Authors Hai, Trinh Ngoc, Thuy, Le Qung
Format Journal Article
LanguageEnglish
Published Vilnius Vilnius Gediminas Technical University 01.01.2019
Subjects
Algorithms
bilevel optimization
Boundary value problems
contractive mapping
equilibrium problem
Fixed point theory
Fixed points (mathematics)
Functions (Mathematics)
Groups (Mathematics)
Iterative methods
Mapping
Maps (Mathematics)
Mathematical research
nonexpansive semigroup
strong monotonicity
contractive mapping
strong monotonicity
bilevel optimization
nonexpansive semigroup
equilibrium problem
Online AccessGet full text
ISSN1392-6292
1648-3510
DOI10.3846/mma.2019.004

Cover

More Information
Summary:In this paper, we consider the proximal mapping of a bifunction. Under the Lipschitz-type and the strong monotonicity conditions, we prove that the proximal mapping is contractive. Based on this result, we construct an iterative process for solving the equilibrium problem over the fixed point sets of a nonexpansive semigroup and prove a weak convergence theorem for this algorithm. Also, some preliminary numerical experiments and comparisons are presented. First Published Online: 21 Nov 2018
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1392-6292
1648-3510
DOI:10.3846/mma.2019.004