Weak and strong convergence of prox-penalization and splitting algorithms for bilevel equilibrium problems

DOI10.3934/NACO.2013.3.353zbMath1383.49006OpenAlexW2330698748MaRDI QIDQ1953160

Zaki Chbani, Hassan Riahi

Publication date: 7 June 2013

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2013.3.353

zbMATH Keywords

fixed pointsplitting algorithmweak and strong convergencebilevel equilibrium problempenalty proximal algorithm

Mathematics Subject Classification ID

Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

Unnamed Item ⋮ One-step iterative method for bilevel equilibrium problem in Hilbert space ⋮ Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications ⋮ Weak and strong convergences of the generalized penalty Forward–Forward and Forward–Backward splitting algorithms for solving bilevel hierarchical pseudomonotone equilibrium problems ⋮ Generalized Proximal Distances for Bilevel Equilibrium Problems ⋮ A new Popov's subgradient extragradient method for two classes of equilibrium programming in a real Hilbert space

This page was built for publication: Weak and strong convergence of prox-penalization and splitting algorithms for bilevel equilibrium problems