Abstract
Our aim in this paper is to study variants and computational errors of the extragradient method for solving equilibrium problems. First, we consider convergence of the method when domains in the auxiliary subproblems of the extragradient algorithm are replaced by outer and inner approximation polyhedra. Then, computational errors are showed under the asymptotic optimality condition, but the bifunction must satisfy certain Lipschitz-type continuous conditions. Next, by using Armijo-type linesearch techniques commonly used in variational inequalities, we obtain an approximation linesearch algorithm without Lipschitz continuity. Convergence analysis of the algorithms is considered under mild conditions on the iterative parameters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Malaysian Mathematical Sciences Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
