Some generalizations of the criss-cross method for quadratic programming

DOI10.1080/02331939208843783MaRDI QIDQ4327908zbMATH OpenOpenAlexFDO

Authors 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

criss-cross methodleast index resolutionlinear complementarity problempivoting methodsquadratic programmingsimplex method

Mathematics Subject Classification ID

Linear programming (90C05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A new proof for the criss-cross method for quadratic programming
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• scientific article; zbMATH DE number 2099987
• The linear complementarity problem, sufficient matrices, and the criss- cross method

Cites work

• A combinatorial abstraction of linear programming
• A combinatorial approach to convex quadratic programming
• A convergent criss-cross method
• A finite crisscross method for oriented matroids
• A new algorithm for quadratic programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementarity in Oriented Matroids
• Complementary pivot theory of mathematical programming
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Equivalence of some quadratic programming algorithms
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• 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
• Some Empirical Tests of the Criss-Cross Method
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• The Criss-Cross Method for Solving Linear Programming Problems
• The general quadratic optimization problem
• The Simplex Method for Quadratic Programming
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• Variants of the Hungarian method for solving linear programming problems

Cited in

(17)

• 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 2 block matrices
• New variants of finite criss-cross pivot algorithms for linear programming
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• The finite criss-cross method for hyperbolic programming
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• On solving parametric multiobjective quadratic programs with parameters in general locations
• A new proof for the criss-cross method for quadratic programming
• scientific article; zbMATH DE number 2099987 (Why is no real title available?)
• Exterior point simplex-type algorithms for linear and network optimization problems
• Finiteness of Criss-Cross Method in Complementarity Problem
• scientific article; zbMATH DE number 4185398 (Why is no real title available?)
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• Sufficient matrices: properties, generating and testing
• Multiple faces of optimization. A tribute to Tamás Terlaky on his 70th birthday

This page was built for publication: Some generalizations of the criss-cross method for quadratic programming

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