当前位置: X-MOL 学术Optimization › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
Optimization ( IF 2.2 ) Pub Date : 2021-06-29 , DOI: 10.1080/02331934.2021.1946057
Le Hai Yen 1 , Le Dung Muu 2
Affiliation  

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.



中文翻译:

凸集交集下拟凸平衡问题的并行次梯度投影算法

在本文中,我们研究了双函数关于第二个变量可能是拟凸的且可行集是有限个凸集的交集的均衡问题。我们提出了一种投影算法,可以在每个组件集上独立计算投影。研究了该算法的收敛性,并提供了涉及仿射分数运算符的变分不等式问题的数值示例,以证明该算法的行为。

更新日期:2021-06-29
down
wechat
bug