Prefer a chat interface with context about you and your work?
AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
The purpose of this paper is to present an O(n^3L) algorithm for a linear complementarity problem with a positive semi-definite matrix. The algorithm is superior to other O(n^3L) algorithms in the point that it is able to start from any initial feasible point whose components lie between 2^<-O(L)> and 2^<0(L)>. …