The linear complementarity problem , sufficient matrices and the criss-cross method Report

@inproceedings{Hertog1990TheLC,
  title={The linear complementarity problem , sufficient matrices and the criss-cross method Report},
  author={Dick den Hertog and Clement Roos and Tams Terlaky},
  year={1990}
}
Specially structured Linear Complementarity Problems (LCP's) and their solution by the criss{ cross method are examined in this paper. The criss{cross method is known to be nite for LCP's with positive semide nite bisymmetric matrices and with P{matrices. It is also a simple nite algorithm for oriented matroid programming problems. Recently Cottle, Pang and Venkateswaran identi ed the class of (column, row) su cient matrices. They showed that su cient matrices are a common generalization of P… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

Zsolt Csizmadia, Tibor Illés, Adrienn Fico
  • 2013
VIEW 3 EXCERPTS
CITES BACKGROUND

Criss-Cross Pivoting Rules

  • Encyclopedia of Optimization
  • 2009

The finite criss-cross method for hyperbolic programming

  • European Journal of Operational Research
  • 1996
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

The principal pivoting method revisited

  • Math. Program.
  • 1990
VIEW 18 EXCERPTS
HIGHLY INFLUENTIAL

The Principal Pivoting Method of Quadratic Programming

R. W. Cottle
  • Mathematics of Decision Sciences,
  • 1968
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

A General Algorithmic Framework for Quadratic Pro- gramming and a Generalization of Edmonds{Fukuda Rule as a Finite Version of Van de Panne{Whinston Method

K. Fukuda, T. Terlaky
  • 1989
VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers