Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids

DOI10.1007/BF02124679zbMath0693.05020OpenAlexW2004342328MaRDI QIDQ584271

Tamás Terlaky, Emil Klafszky

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02124679

zbMATH Keywords

symmetryQuadratic programmingoriented matroidsdefinitenessfinite criss-cross methodlinear complementary problemoriented matroid quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On extremal behaviors of Murty's least index method, Criss-cross methods: A fresh view on pivot algorithms, Combinatorial characterizations of \(K\)-matrices, Some generalizations of the criss-cross method for quadratic programming, Games in oriented matroids, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Enumeration of PLCP-orientations of the 4-cube, New method for determining search directions for interior-point algorithms in linear optimization, The linear complementarity problem, sufficient matrices, and the criss- cross method, Pivot rules for linear programming: A survey on recent theoretical developments

Cites Work

• Unnamed Item
• Linear quadratic programming in oriented matroids
• On \(\ell_ p\) programming
• A finite crisscross method for oriented matroids
• A new algorithm for quadratic programming
• Symmetry and positive definiteness in oriented matroids
• Convexity in oriented matroids
• Orientability of matroids
• A combinatorial abstraction of linear programming
• Bases in oriented matroids
• Oriented matroids and multiply ordered sets
• Complementary pivot theory of mathematical programming
• The Criss-Cross Method for Solving Linear Programming Problems
• Complementarity in Oriented Matroids
• The Simplex Method for Quadratic Programming
• Equivalence of some quadratic programming algorithms
• A convergent criss-cross method
• Least-index resolution of degeneracy in quadratic programming
• New Finite Pivoting Rules for the Simplex Method
• Some generalizations of the criss-cross method for quadratic programming
• The general quadratic optimization problem
• Variants of the Hungarian method for solving linear programming problems
• On the Abstract Properties of Linear Dependence
• Bimatrix Equilibrium Points and Mathematical Programming
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Duality Theory of Linear Programs: A Constructive Approach with Applications