An Efficient Algorithm for Linear Complementarity Problems
Year: 2011
Type: article
Abstract: 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.
Source: Advanced materials research
Authors: Li Pu Zhang, Ying Hong Xu
Institutions: Zhejiang A & F University, Zhejiang Sci-Tech University
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Keyword: linear complementarity problem
Open Access status: hybrid
OpenAlex ID: W2062043871
