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

DOI10.1007/BF02124679MaRDI QIDQ584271zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

symmetryoriented matroidsdefinitenessfinite criss-cross methodlinear complementary problemoriented matroid quadratic programmingQuadratic 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)

Recommendations

• scientific article; zbMATH DE number 4185398
• Some generalizations of the criss-cross method for quadratic programming
• scientific article; zbMATH DE number 2099987
• scientific article; zbMATH DE number 819135
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS

Cites work

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

Cited in

(18)

• scientific article; zbMATH DE number 799945 (Why is no real title available?)
• Enumeration of PLCP-orientations of the 4-cube
• Some generalizations of the criss-cross method for quadratic programming
• On extremal behaviors of Murty's least index method
• Criss-cross methods: A fresh view on pivot algorithms
• scientific article; zbMATH DE number 4185398 (Why is no real title available?)
• A finite crisscross method for oriented matroids
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Pivot rules for linear programming: A survey on recent theoretical developments
• Linear quadratic programming in oriented matroids
• Combinatorial characterizations of \(K\)-matrices
• New method for determining search directions for interior-point algorithms in linear optimization
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• scientific article; zbMATH DE number 3985244 (Why is no real title available?)
• A new proof for the criss-cross method for quadratic programming
• Games in oriented matroids
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices

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)