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...

Descripción completa

Detalles Bibliográficos
Autores principales: Mohamed Achache, Naima Boudiaf
Formato: Artículo
Lenguaje:English
Publicado: Publishing House of the Romanian Academy 2011-08-01
Colección:Journal of Numerical Analysis and Approximation Theory
Materias:
Acceso en línea:https://www.ictp.acad.ro/jnaat/journal/article/view/1040