Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems
DOI10.1007/s11075-016-0244-2OpenAlexW2560360755MaRDI QIDQ2408150
Publication date: 10 October 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0244-2
error estimatesparallel computationequilibrium problemLipschitz-type continuitystrong pseudomonotonicitysplitting-up technique
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Parallel numerical computation (65Y05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel hybrid iterative methods for variational inequalities, equilibrium problems, and common fixed point problems
- Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings
- A direct splitting method for nonsmooth variational inequalities
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- A Douglas-Rachford splitting method for solving equilibrium problems
- Dual extragradient algorithms extended to equilibrium problems
- Modified projection method for strongly pseudomonotone variational inequalities
- On the convergence of splitting proximal methods for equilibrium problems in Hilbert spaces
- The interior proximal extragradient method for solving equilibrium problems
- An ergodic algorithm for the power-control games for CDMA data networks
- Strong convergence theorem for a generalized equilibrium problem and a nonexpansive mapping in a Hilbert space
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Equilibrium programming using proximal-like algorithms
- Gap functions for equilibrium problems
- Convex analysis and nonlinear optimization. Theory and examples
- Combined relaxation methods for variational inequalities
- Some algorithms for general monotone mixed variational inequalities
- Gradient approach of computing fixed points of equilibrium problems
- Extragradient methods and linesearch algorithms for solving Ky Fan inequalities and fixed point problems
- A new class of hybrid extragradient algorithms for solving quasi-equilibrium problems
- Iterative schemes for quasimonotone mixed variational inequalities
- On Weak Convergence of the Douglas–Rachford Method
- Iterative Algorithms for Nonlinear Operators
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- A projection algorithm for solving pseudomonotone equilibrium problems and it's application to a class of bilevel equilibria
- Extragradient algorithms extended to equilibrium problems¶
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces
- A strong convergence theorem for equilibrium problems and generalized hybrid mappings