Login / Signup
Theoretical Bound of the Complexity of Someextragradient-Type Algorithms for Variational Inequalities in Banach Spaces.
Serhii Denysov
Vladimir Semenov
Published in:
IT&I Workshops (2021)
Keyphrases
</>
worst case
variational inequalities
computational complexity
learning algorithm
convex sets
np hard
objective function
lower bound
sensitivity analysis
approximation algorithms
nash equilibrium
complementarity problems