Some generalizations of the criss-cross method for quadratic programming

DOI10.1080/02331939208843783zbMath0814.49029MaRDI QIDQ4327908

Tamás Terlaky, Emil Klafszky

Publication date: 11 June 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843783

zbMATH Keywords

quadratic programming; linear complementarity problem; simplex method; criss-cross method; pivoting methods; least index resolution

Mathematics Subject Classification ID

90C20: Quadratic programming

90C05: Linear programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, The linear complementarity problem, sufficient matrices, and the criss- cross method, Pivot rules for linear programming: A survey on recent theoretical developments, Criss-cross methods: A fresh view on pivot algorithms, Inverses of \(2\times 2\) block matrices, New variants of finite criss-cross pivot algorithms for linear programming, The finite criss-cross method for hyperbolic programming, New variants of the criss-cross method for linearly constrained convex quadratic programming

Cites Work

• Unnamed Item
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• Linear quadratic programming in oriented matroids
• On \(\ell_ p\) programming
• A finite crisscross method for oriented matroids
• A new algorithm for quadratic programming
• A combinatorial abstraction of linear programming
• Complementary pivot theory of mathematical programming
• A combinatorial approach to convex quadratic 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
• The general quadratic optimization problem
• Variants of the Hungarian method for solving linear programming problems
• 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
• Some Empirical Tests of the Criss-Cross Method