Results 1 
2 of
2
Linear Complementarity and Oriented Matroids
 Journal of the Operational Research Society of Japan
, 1990
"... A combinatorial abstraction of the linear complementarity theory in the setting of oriented matroids was rst considered by M.J. Todd. In this paper, we take a fresh look at this abstraction, and attempt to give a simple treatment of the combinatorial theory of linear complementarity. We obtain new t ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
(Show Context)
A combinatorial abstraction of the linear complementarity theory in the setting of oriented matroids was rst considered by M.J. Todd. In this paper, we take a fresh look at this abstraction, and attempt to give a simple treatment of the combinatorial theory of linear complementarity. We obtain new theorems, proofs and algorithms in oriented matroids whose specializations to the linear case are also new. For this, the notion of suciency of square matrices, introduced by Cottle, Pang and Venkateswaran, is extended to oriented matroids. Then, we prove a sort of duality theorem for oriented matroids, which roughly states: exactly one of the primal and the dual system has a complementary solution if the associated oriented matroid satisfies "weak" sufficiency. We give two different proofs for this theorem, an elementary inductive proof and an algorithmic proof using the crisscross method which solves one of the primal or dual problem by using surprisingly simple pivot rules (without any pertur...
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(κ) Linear Complementarity Problems
, 1998
"... We deal with Linear Complementarity Problems (LCPs) with P () matrices. First we establish the convergence rate of the complementary variables along the central path. The central path is parameterized by the barrier parameter , as usual. Our elementary proof reproduces the known result that the var ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
We deal with Linear Complementarity Problems (LCPs) with P () matrices. First we establish the convergence rate of the complementary variables along the central path. The central path is parameterized by the barrier parameter , as usual. Our elementary proof reproduces the known result that the variables on, or close to the central path fall apart in three classes in which these variables are O(1); O() and O( p ), respectively. The constants hidden in these bounds are expressed in, or bounded by, the input data. All this is preparation for our main result: a strongly polynomial rounding procedure. Given a point with sufficiently small complementarity gap and close enough to the central path, the rounding procedure produces a maximally complementary solution in at most O(n³) arithmetic operations. The result implies that Interior Point Methods (IPMs) not only converge to a complementary solution of P () LCPs but, when furnished with our rounding procedure, they can produce a max...