123 search results - page 1 / 25 » Using vector divisions in solving linear complementarity pro... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
MP
2006
13 years 4 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
ANNPR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
MP
2008
13 years 4 months ago
2008
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
SIAMJO
2008
13 years 4 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...