New inertial regularized algorithm for solving strongly pseudomonotone equilibrium problems
From MaRDI portal
Publication:6292708
DOI10.1007/S11075-018-0532-0arXiv1710.06544WikidataQ129817559 ScholiaQ129817559MaRDI QIDQ6292708
Publication date: 17 October 2017
Abstract: The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with inertial effects. The main novelty of the algorithm is that it can be done without previously knowing the information on the strongly pseudomonotone and Lipschitz-type constants of cost bifunction. A reasonable explain for this is that the algorithm uses a sequence of stepsizes which is diminishing and non-summable. Theorem of strong convergence is proved. In the case, when the information on the modulus of strong pseudomonotonicity and Lispchitz-type constant is known,the rate of linear convergence of the algorithm has been established. Several of numerical experiments are performed to illustrate the convergence of the algorithm and also compare it with other algorithms.
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) General equilibrium theory (91B50) Numerical solutions to equations with nonlinear operators (65J15)
This page was built for publication: New inertial regularized algorithm for solving strongly pseudomonotone equilibrium problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292708)
