scholarly journals The Generalized Horizontal Linear Complementarity Problem

2013 ◽  
Vol 5 (1) ◽  
Author(s):  
Aniekan A. Ebiefung ◽  
Bidushi J. Chakraborty
2011 ◽  
Vol 204-210 ◽  
pp. 687-690
Author(s):  
Li Pu Zhang ◽  
Ying Hong Xu

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.


Sign in / Sign up

Export Citation Format

Share Document