A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
Optimization and Control
2020-10-02 v1
Abstract
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 behavior of the algorithm.
Cite
@article{arxiv.2010.00186,
title = {A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets},
author = {Le Hai Yen and Le Dung Muu},
journal= {arXiv preprint arXiv:2010.00186},
year = {2020}
}