A subgradient-type method for the equilibrium problem over the fixed point set and its applications
From MaRDI portal
Publication:3622019
DOI10.1080/02331930701762829zbMath1158.47312MaRDI QIDQ3622019
Publication date: 23 April 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701762829
variational inequality problem; equilibrium problem; metric projection; saddle point problem; Nash equilibrium problem; firmly nonexpansive mapping; subgradient-type method
47J20: Variational and other types of inequalities involving nonlinear operators (general)
47H06: Nonlinear accretive operators, dissipative operators, etc.
47J25: Iterative procedures involving nonlinear operators
Related Items
The hybrid steepest descent method for solving variational inequality over triple hierarchical problems, Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem, Algorithms for solving the variational inequality problem over the triple hierarchical problem, An ergodic algorithm for the power-control games for CDMA data networks, Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping, Extragradient methods and linesearch algorithms for solving Ky Fan inequalities and fixed point problems
Cites Work
- Unnamed Item
- Unnamed Item
- Variational inequalities, complementarity problems, and duality theorems
- Regularization of nonlinear ill-posed variational inequalities and convergence rates
- Computational schemes for large-scale problems in extended linear- quadratic programming
- New existence results for equilibrium problems
- A predictor-corrector method for extended linear-quadratic programming
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Generalized monotone bifunctions and equilibrium problems
- Non-cooperative games
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Finding the nearest point in A polytope
- A New Projection Method for Variational Inequality Problems
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- Linear-Quadratic Programming and Optimal Control
- Iterative Algorithms for Equilibrium Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Equilibrium points in n -person games
