Extragradient algorithms extended to equilibrium problems¶

Citations Over TimeTop 10% of 2008 papers

Abstract

We make use of the auxiliary problem principle to develop iterative algorithms for solving equilibrium problems. The first one is an extension of the extragradient algorithm to equilibrium problems. In this algorithm the equilibrium bifunction is not required to satisfy any monotonicity property, but it must satisfy a certain Lipschitz-type condition. To avoid this requirement we propose linesearch procedures commonly used in variational inequalities to obtain projection-type algorithms for solving equilibrium problems. Applications to mixed variational inequalities are discussed. A special class of equilibrium problems is investigated and some preliminary computational results are reported.

Related Papers

• → A complete monotonicity property of the gamma function(2004)186 cited
• → Stability in measure for uncertain delay differential equations based on new Lipschitz conditions(2021)5 cited
• → On Lipschitz maps and the Hölder regularity of flows(2015)2 cited
• → Optimal Lipschitz extensions(2018)