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

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

Taispeáin leaganacha eile (1)

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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí: Mohamed Achache, Naima Boudiaf
Formáid: Alt
Teanga:English
Foilsithe / Cruthaithe: Publishing House of the Romanian Academy 2011-08-01
Sraith:Journal of Numerical Analysis and Approximation Theory
Ábhair:
semidefinite linear complementarity problems
interior point methods
long and small-update primal-dual algorithms
polynomial complexity
Rochtain ar líne:https://www.ictp.acad.ro/jnaat/journal/article/view/1040

Ar líne

https://www.ictp.acad.ro/jnaat/journal/article/view/1040

Míreanna comhchosúla