ISSN:
1436-4646
Keywords:
Linear Complementarity Problem
;
Complementary Cones
;
Complementary Pivot Methods
;
Computational Complexity
;
Exponential Growth
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Murty in a recent paper has shown that the computational effort required to solve a linear complementarity problem (LCP), by either of the two well known complementary pivot methods is not bounded above by a polynomial in the size of the problem. In that paper, by constructing a class of LCPs—one of ordern forn ≥ 2—he has shown that to solve the problem of ordern, either of the two methods goes through 2 n pivot steps before termination. However that paper leaves it as an open question to show whether or not the same property holds if the matrix,M, in the LCP is positive definite and symmetric. The class of LCPs in whichM is positive definite and symmetric is of particular interest because of the special structure of the problems, and also because they appear in many practical applications. In this paper, we study the computational growth of each of the two methods to solve the LCP, (q, M), whenM is positive definite and symmetric and obtain similar results.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01588254
