Complexity bounds for a combined relaxation method

From MaRDI portal
Publication:5954338

zbMath0986.49004MaRDI QIDQ5954338

Igor V. Konnov

Publication date: 3 June 2002

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)




Related Items (14)

Versions of the subgradient extragradient method for pseudomonotone variational inequalitiesAn extragradient method for non-monotone equilibrium problems on Hadamard manifolds with applicationsA Self-Adaptive Step Size Algorithm for Solving Variational Inequalities with the Split Feasibility Problem with Multiple Output Sets ConstraintsVariational Inequalities Over the Intersection of Fixed Point Sets of Generalized Demimetric Mappings and Zero Point Sets of Maximal Monotone MappingsModified inertial subgradient extragradient method for equilibrium problemsConvergence of the projection and contraction methods for solving bilevel variational inequality problemsAn extragradient algorithm for solving bilevel pseudomonotone variational inequalitiesOuter approximation algorithms for pseudomonotone equilibrium problemsParallel Algorithms for Solving a Class of Variational Inequalities over the Common Fixed Points Set of a Finite Family of Demicontractive MappingsStrong convergence theorems for nonexpansive mappings and Ky Fan inequalitiesDescent methods for equilibrium problems in a Banach spaceInertial extragradient algorithms for strongly pseudomonotone variational inequalitiesRegularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium modelA hybrid subgradient algorithm for finding a common solution of an equilibrium problem and a family of strict pseudocontraction mappings







This page was built for publication: Complexity bounds for a combined relaxation method