Name
Abstract | ||
|---|---|---|
We present a variant of the analytic center cutting plane algorithm proposed by Goffin et al. ( 1996) to approximately solve equilibrium problems as proposed by Blum and Oettli ( 1994), which include as particular problems the variational inequalities problem, the Nash equilibria problem in non-cooperative games, the convex minimization problem, and the fixed point problem. Furthermore, we analyze the convergence and complexity of the modified algorithm. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1051/ro:2006008 | RAIRO-OPERATIONS RESEARCH |
Keywords | Field | DocType |
equilibrium problems,convex feasibility problem,analytic center cutting plane algorithm | Convergence (routing),Mathematical optimization,Cutting-plane method,Equilibrium point,Game theory,Nash equilibrium,Convex optimization,Non-cooperative game,Mathematics,Variational inequality | Journal |
Volume | Issue | ISSN |
40 | 1 | 0399-0559 |
Citations | PageRank | References |
3 | 0.46 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernanda M. P. Raupp | 1 | 29 | 5.35 |
| Wilfredo Sosa | 2 | 43 | 6.22 |