scholarly journals An interior-point method for the Cartesian P*(k)-linear complementarity problem over symmetric cones

ORiON ◽  
2014 ◽  
Vol 30 (1) ◽  
pp. 41 ◽  
Author(s):  
B Kheirfam
Author(s):  
Youssef El Foutayeni ◽  
Mohamed Khaladi

In this paper, we present a new interior-point method of convergence order six to solve the linear complementarity problem. Computational efficiency in its general form is discussed and a comparison between the efficiency of the proposed method and existing ones is made. The performance is tested through numerical experiments on some test problems and a practical example of bio-economic equilibrium model.


2012 ◽  
Vol 29 (02) ◽  
pp. 1250015 ◽  
Author(s):  
G. Q. WANG

In this paper, we present a new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones by employing the framework of Euclidean Jordan algebras. At each iteration, we use only full Nesterov and Todd steps. The currently best known iteration bound for small-update method, namely, [Formula: see text], is obtained, where r denotes the rank of the associated Euclidean Jordan algebra and ε the desired accuracy.


Sign in / Sign up

Export Citation Format

Share Document