A carregar...

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.

Na minha lista:
Detalhes bibliográficos
Main Authors: Salahuddin, Meshari Alesemi
Formato: Artigo
Idioma:Inglês
Publicado em: SpringerOpen 2019-03-01
Colecção:Journal of Inequalities and Applications
Assuntos:
Acesso em linha:http://link.springer.com/article/10.1186/s13660-019-2024-8
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!