A new solution method for equilibrium problems

A globally convergent algorithm for equilibrium problems with differentiable bifunctions is proposed. The algorithm is based on descent directions of a suitable family of gap functions. The novelty of the approach is that assumptions which guarantee that the stationary points of the gap functions are global optima are not required.

[1]  G. Cohen.  Auxiliary problem principle extended to variational inequalities , 1988 .

[2]  Michael Patriksson.  On the convergence of descent methods for monotone variational inequalities , 1994, Oper. Res. Lett..

[3]  Patrice Marcotte,et al.  Modified descent methods for solving the monotone variational inequality problem , 1993, Oper. Res. Lett..

[4]  Jen-Chih Yao,et al.  Descent methods for equilibriumproblems in a Banach space , 2004 .

[5]  I. Konnov,et al.  Descent methods for monotone equilibrium problems in Banach spaces , 2006 .

[6]  Giandomenico Mastroeni,et al.  Gap Functions for Equilibrium Problems , 2003, J. Glob. Optim..

[7]  Masao Fukushima,et al.  Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems , 1992, Math. Program..

[8]  Hanif D. Sherali,et al.  A mathematical programming approach for determining oligopolistic market equilibrium , 1982, Math. Program..

[9]  W. Oettli,et al.  From optimization and variational inequalities to equilibrium problems , 1994 .

[10]  Barbara Panicucci,et al.  A globally convergent descent method for nonsmooth variational inequalities , 2009, Comput. Optim. Appl..

[11]  P. Marcotte,et al.  An extended descent framework for variational inequalities , 1994 .

[12]  G. Mastroeni.  On Auxiliary Principle for Equilibrium Problems , 2003 .

[13]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[14]  P. Marcotte.  Algorithms for the Network Oligopoly Problem , 1987 .