scientific article; zbMATH DE number 2099987

MaRDI QIDQ4816526zbMATH OpenFDO

Authors Arif A. Akkeleş, László Balogh, Tibor Illés

Publication date 8 September 2004

zbMATH Keywords

linear complementarity problemscriss-cross method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• New variants of the criss-cross method for linearly constrained convex quadratic programming
• Some generalizations of the criss-cross method for quadratic programming
• Finiteness of Criss-Cross Method in Complementarity Problem
• A new proof for the criss-cross method for quadratic programming
• New variants of finite criss-cross pivot algorithms for linear programming

Cited in

(5)

• New variants of the criss-cross method for linearly constrained convex quadratic programming
• A new proof for the criss-cross method for quadratic programming
• Some generalizations of the criss-cross method for quadratic programming
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4816526)