A parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex sets
| Autor: | Le Dung Muu, Le Hai Yen |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
021103 operations research
Control and Optimization Applied Mathematics Feasible region 0211 other engineering and technologies Regular polygon 02 engineering and technology Management Science and Operations Research 01 natural sciences 010101 applied mathematics Quasiconvex function Intersection Optimization and Control (math.OC) FOS: Mathematics Projection method Applied mathematics 0101 mathematics Finite set Subgradient method Mathematics - Optimization and Control Dykstra's projection algorithm Mathematics |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|