Cargando...
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.
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
SpringerOpen
2019-03-01
|
| Colección: | Journal of Inequalities and Applications |
| Materias: | |
| Acceso en línea: | http://link.springer.com/article/10.1186/s13660-019-2024-8 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|