A projected subgradient algorithm for bilevel equilibrium problems and applications (Q1686664)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A projected subgradient algorithm for bilevel equilibrium problems and applications |
scientific article |
Statements
A projected subgradient algorithm for bilevel equilibrium problems and applications (English)
0 references
15 December 2017
0 references
A new computational method is proposed to solve bilevel equilibrium problems in a real Hilbert space. The algorithm is designed such that subgradients of two convex functions and one projection onto a convex set are computed at each iteration. As consequence, the procedure provided by the authors has a low computational cost. Some numerical experiments illustrate the convergence of the algorithm. The procedure is particularized on the equilibrium problem over a fixed point set.
0 references
bilevel equilibrium problems
0 references
subgradient method
0 references
projection method
0 references
strong monotonicity
0 references
pseudoparamonotonicity
0 references
algorithm
0 references
numerical experiments
0 references
convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references