An Efficient Algorithm for Linear Complementarity Problems
2011 ◽
Vol 204-210
◽
pp. 687-690
Keyword(s):
Set Up
◽
Through some modifications on the classical-Newton direction, we obtain a new searching direction for monotone horizontal linear complementarity problem. By taking the step size along this direction as one, we set up a full-step primal-dual interior-point algorithm for monotone horizontal linear complementarity problem. The complexity bound for the algorithm is derived, which is the best-known for linear complementarity problem.
2017 ◽
Vol 94
(12)
◽
pp. 2271-2282
2019 ◽
Vol 12
(07)
◽
pp. 2050001
2011 ◽
Vol 219-220
◽
pp. 1089-1092
2010 ◽
Vol 29-32
◽
pp. 725-731
2016 ◽
Vol 09
(02)
◽
pp. 1650039
2013 ◽
Vol 5
(5)
◽
pp. 1830-1825