Abstract
The goal of this paper is to discuss iteration complexity of two projection type methods for solving generalized complementarity problems and establish their worst-case sub-linear convergence rates measured by the iteration complexity in both the ergodic and the nonergodic sense.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have