Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
DOI10.1007/BF02124679zbMATH Open0693.05020OpenAlexW2004342328MaRDI QIDQ584271FDOQ584271
Authors: 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
Recommendations
symmetryoriented matroidsdefinitenessfinite criss-cross methodlinear complementary problemoriented matroid quadratic programmingQuadratic programming
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)
Cites Work
- The Simplex Method for Quadratic Programming
- Complementary pivot theory of mathematical programming
- Bimatrix Equilibrium Points and Mathematical Programming
- New Finite Pivoting Rules for the Simplex Method
- On \(\ell_ p\) programming
- A finite crisscross method for oriented matroids
- A convergent criss-cross method
- Convexity in oriented matroids
- On the Abstract Properties of Linear Dependence
- The Criss-Cross Method for Solving Linear Programming Problems
- Orientability of matroids
- Complementarity in Oriented Matroids
- Some generalizations of the criss-cross method for quadratic programming
- Duality Theory of Linear Programs: A Constructive Approach with Applications
- A combinatorial abstraction of linear programming
- A new algorithm for quadratic programming
- Symmetry and positive definiteness in oriented matroids
- Bases in oriented matroids
- Oriented matroids and multiply ordered sets
- Equivalence of some quadratic programming algorithms
- Least-index resolution of degeneracy in quadratic programming
- The general quadratic optimization problem
- Variants of the Hungarian method for solving linear programming problems
- Title not available (Why is that?)
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- Linear quadratic programming in oriented matroids
Cited In (18)
- A new proof for the criss-cross method for quadratic programming
- A finite crisscross method for oriented matroids
- Criss-cross methods: A fresh view on pivot algorithms
- New method for determining search directions for interior-point algorithms in linear optimization
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- Linear quadratic programming in oriented matroids
- Title not available (Why is that?)
- Combinatorial characterizations of \(K\)-matrices
- Enumeration of PLCP-orientations of the 4-cube
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Some generalizations of the criss-cross method for quadratic programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Title not available (Why is that?)
- On extremal behaviors of Murty's least index method
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- Games in oriented matroids
- Title not available (Why is that?)
This page was built for publication: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584271)
