Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem

1994 ◽  
Vol 4 (2) ◽  
pp. 247-261 ◽  
Author(s):  
Kevin McShane
Keyword(s):  
Linear Programming ◽  
Linear Complementarity Problem ◽  
Interior Point ◽  
Complementarity Problem ◽  
Linear Complementarity ◽  
Interior Point Algorithms

scholarly journals Numerical Results for the General Linear Complementarity Problem

2019 ◽  
Vol 11 (1) ◽  
pp. 43-46
Author(s):  
Zsolt Darvay ◽  
Ágnes Füstös
Keyword(s):  
Programming Language ◽  
Linear Complementarity Problem ◽  
Interior Point ◽  
Complementarity Problem ◽  
Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Results ◽  
Interior Point Algorithm ◽  
C Programming Language ◽  
C Programming

Abstract In this article we discuss the interior-point algorithm for the general complementarity problems (LCP) introduced by Tibor Illés, Marianna Nagy and Tamás Terlaky. Moreover, we present a various set of numerical results with the help of a code implemented in the C++ programming language. These results support the efficiency of the algorithm for both monotone and sufficient LCPs.

Sign in / Sign up

Export Citation Format

Share Document