Equivaence between different formulations of the linear complementarity promblem
Authors:
- 1 January 1997
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 7 (3-4) , 265-290
Abstract
One shows that different formulations of the linear complementarity problem (LCP), such as the horizontal LCP, the mixed LCP and the geometric LCP can be transformed into a standard LCR The P*(k)-property (a more general property than monotonicity) of the corresponding formulations as well as the convergence properties of a large class of interior-point algorithms are invariant with respect to the transformations. Therefore it is sufficient to study the algorithms only for the standard LCPKeywords
This publication has 6 references indexed in Scilit:
- A path-following interior-point algorithm for linear and quadratic problemsAnnals of Operations Research, 1996
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problemsApplied Mathematics & Optimization, 1996
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity ProblemMathematics of Operations Research, 1996
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1996
- Generalized Linear Complementarity ProblemsMathematics of Operations Research, 1995
- Sufficient matrices and the linear complementarity problemLinear Algebra and its Applications, 1989