Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem

In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path. We provide an unified ana...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Mohamed Achache, Naima Boudiaf
Formato:	Artigo
Idioma:	Inglês
Publicado em:	Publishing House of the Romanian Academy 2011-08-01
Colecção:	Journal of Numerical Analysis and Approximation Theory
Assuntos:	semidefinite linear complementarity problems interior point methods long and small-update primal-dual algorithms polynomial complexity
Acesso em linha:	https://www.ictp.acad.ro/jnaat/journal/article/view/1040
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!