Iteration complexity of generalized complementarity problems
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-03-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13660-019-2024-8 |