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
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity pro...
he use of an Infeasible Interior-Point (IIP) algorithm is investigated for the solution of the Linea...
We present an interior-point method for the P∗(κ)-linear complementarity problem (LCP) that is based...
In this article, we study the interior-point algorithm for solving linear complementarity problems, ...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
In this thesis, we consider the Linear Complementarity Problem (LCP), which is a well-known mathemat...
Linear Complementarity Problems (LCP s) belong to the class of NP-complete problems. Therefore we ca...
We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear compleme...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) whi...
International audienceIn this paper, we present a new interior point method with full Newton step fo...
Linear Complementarity Problems (LCPs) belong to the class of -complete problems. Therefore we canno...
We introduce a new feasible corrector-predictor (CP) interior-point algorithm (IPA), which is suitab...
We study a predictor-corrector interior-point algorithm for solving general linear complementarity p...
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity pro...
he use of an Infeasible Interior-Point (IIP) algorithm is investigated for the solution of the Linea...
We present an interior-point method for the P∗(κ)-linear complementarity problem (LCP) that is based...
In this article, we study the interior-point algorithm for solving linear complementarity problems, ...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
In this thesis, we consider the Linear Complementarity Problem (LCP), which is a well-known mathemat...
Linear Complementarity Problems (LCP s) belong to the class of NP-complete problems. Therefore we ca...
We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear compleme...
Linear Complementarity Problems (LCPs) belong to the class of NP-complete problems. Therefore we can...
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) whi...
International audienceIn this paper, we present a new interior point method with full Newton step fo...
Linear Complementarity Problems (LCPs) belong to the class of -complete problems. Therefore we canno...
We introduce a new feasible corrector-predictor (CP) interior-point algorithm (IPA), which is suitab...
We study a predictor-corrector interior-point algorithm for solving general linear complementarity p...
A modified predictor-corrector algorithm is proposed for solving monotone linear complementarity pro...
he use of an Infeasible Interior-Point (IIP) algorithm is investigated for the solution of the Linea...
We present an interior-point method for the P∗(κ)-linear complementarity problem (LCP) that is based...
View in ORKG
DOI