Modified golden ratio algorithms for solving equilibrium problems

Authors Dang Van Hieu, Jean-Jacques Strodiot, Le Dung Muu

Publication date 9 July 2019

Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) General equilibrium theory (91B50)

Abstract: In this paper an explicit algorithm is proposed for solving an equilibrium problem whose associated bifunction is pseudomonotone and satisfies a Lipschitz-type condition. Contrary to many algorithms, our algorithm is done without using explicitly the Lipschitz constants of bifunction although its convergence is obtained under such that condition. The introduced method is a form of proximal-like method whose steplengths are explicitly generated at each iteration without using any linesearch procedure. First we prove the convergence of the algorithm, and after we establish its

R

-linear rate of convergence under the assumption of strong pseudomonotonicity of the bifunction. Afterwards several numerical results are displayed to illustrate and to compare the behavior of the new algorithm with other ones.

This page was built for publication: Modified golden ratio algorithms for solving equilibrium problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6321784)