3 May 2007 in Mathematical Programming
1 June 2003 in Optimization
We consider equilibrium problems in the framework of the formulation proposed by Blum and Oettli, which includes variational inequalities, Nash equilibria in noncooperative games, and vector optimization problems, for instance, as particular cases. We show that such problems are particular instances of convex feasibility problems with infinitely many convex sets, but with additional structure, so that projection algorithms for convex feasibility can be modified in order to improve their convergence properties, mainly achieving global convergence without either compactness or coercivity assumptions. We present a sequential projections algorithm with an approximately most violated constraint control strategy, and two variants where exact orthogonal projections are replaced by approximate ones, using separating hyperplanes generated by subgradients. We include full convergence analysis of these algorithms.
1 January 2003 in Nonlinear Analysis
15 October 2010 in Optimization
We analyse a proximal point method for equilibrium problems in Hilbert spaces, improving upon previously known convergence results. We prove global weak convergence of the generated sequence to a solution of the problem, assuming existence of solutions and rather mild monotonicity properties of the bifunction which defines the equilibrium problem, and we establish existence of solutions of the proximal subproblems. We also present a new reformulation of equilibrium problems as variational inequalities ones.
18 July 2011 in Optimization
In this article, we use Ky Fan's lemma to obtain a new existence result for equilibrium problems which does not invoke monotonicity of the objective function. Then we focus on reformulating of generalized Nash equilibrium problems (GNEPs) in terms of an equilibrium problem under reasonable assumptions. Finally, using our existence result and the reformulation, we obtain an existence result for GNEPs.
1 June 2006 in Journal of Global Optimization