ScholarLens Back to search
2019•Műszaki Tudományos KözleményekOpen access

Implementation of an Interior-point Algorithm for Linear Complementarity Problem Working in a Wide Neighborhood

Zsolt Darvay, Attila-Szabolcs Orbán

Open full text 0 citations

Abstract

Abstract In this article, we study the interior-point algorithm for solving linear complementarity problems, published by Xiaouje Ma, Hongwei Liu, Jianke Zhang and Weijie Cong from the implementation point of view. The algorithm was implemented in C++ programming language, thus supporting the effectiveness of the method. Despite the fact that the theoretical results refer only to the monotone linear complementarity problem, practical testing showed that the algorithm also works well in more general cases.

Open-access reader

About this research paper

What this paper is about

Abstract In this article, we study the interior-point algorithm for solving linear complementarity problems, published by Xiaouje Ma, Hongwei Liu, Jianke Zhang and Weijie Cong from the implementation point of view. The algorithm was implemented in C++ programming language, thus supporting the effectiveness of the method. Despite the fact that the theoretical results refer only to the monotone linear complementarity problem, practical testing showed that the algorithm also works well in more general cases.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract In this article, we study the interior-point algorithm for solving linear complementarity problems, published by Xiaouje Ma, Hongwei Liu, Jianke Zhang and Weijie Cong from the implementation point of view. The algorithm was implemented in C++ programming language, thus supporting the effectiveness of the method. Despite the fact that the theoretical results refer only to the monotone linear complementarity problem, practical testing showed that the algorithm also works well in more general cases.

Key concepts: Linear complementarity problem, Complementarity (molecular biology), Mixed complementarity problem, Complementarity theory, Monotone polygon, Linear programming, Interior point method, Criss-cross algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Implementation of an Interior-point Algorithm for Linear Complementarity Problem Working in a Wide Neighborhood — Research Paper | ScholarLens