A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets

In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection algorithm, where the projection can be computed independently onto each c...

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 71; no. 15; pp. 4447 - 4462
Main Authors: Yen, Le Hai, Muu, Le Dung
Format: Journal Article
Language:English
Published: Philadelphia Taylor & Francis 09.12.2022
Taylor & Francis LLC
Subjects:
Algorithms
Computational geometry
Convexity
Equilibria
intersection
Intersections
Mathematical analysis
Operators (mathematics)
projection method
quasiconvexity
subgradient method
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection algorithm, where the projection can be computed independently onto each component set. The convergence of the algorithm is investigated and numerical examples for a variational inequality problem involving affine fractional operator are provided to demonstrate the behaviour of the algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2021.1946057