Plynomial Convergence of Primal-Dual Algorithms for SDLCP Based on the Monteiro-Zhang Family of Directions
2012 ◽
Vol 532-533
◽
pp. 1857-1860
Keyword(s):
The paper establishes the polynomial converge-nce of a new class of path-following methods for semide- finite linear complementarity problems (SDLCP) whos-se search directions belong to the class of directions introduced by Monteiro [7]. Namely, we show that the polynomial iteration complexity bounds of the well known algori-thm for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP
1998 ◽
Vol 23
(3)
◽
pp. 719-734
◽
2008 ◽
Vol 46
(1)
◽
pp. 31-49
◽
2017 ◽
Vol 38
(5)
◽
pp. 627-640
1998 ◽
Vol 8
(1)
◽
pp. 59-81
◽
Keyword(s):
Keyword(s):
2008 ◽
Vol 47
(3)
◽
pp. 329-342
◽
1995 ◽
pp. 423-434
◽