Path-following interior-point algorithm for monotone linear complementarity problems
Keyword(s):
This paper presents a path-following full-Newton step interior-point algorithm for solving monotone linear complementarity problems. Under new choices of the defaults of the updating barrier parameter [Formula: see text] and the threshold [Formula: see text] which defines the size of the neighborhood of the central-path, we show that the short-step algorithm has the best-known polynomial complexity, namely, [Formula: see text]. Finally, some numerical results are reported to show the efficiency of our algorithm.
2013 ◽
Vol 161
(3)
◽
pp. 853-869
◽
2013 ◽
Vol 59
(1)
◽
pp. 81-99
◽
2011 ◽
Vol 12
(1)
◽
pp. 545-561
◽
2015 ◽
Vol 08
(03)
◽
pp. 1550037
◽
2008 ◽
Vol 47
(3)
◽
pp. 329-342
◽
1993 ◽
Vol 2
(2)
◽
pp. 79-106
◽
2015 ◽
Vol 25
(1)
◽
pp. 57-72
◽